Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Operational Research

• Publication date

  1998-03-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1287/opre.46.3.355
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the 0/1 knapsack polytope

  1997cited by this paper
• On Facets of Knapsack Equality Polytopes

  1997cited by this paper
• On Facets of Knapsack Equality Polytopes

  1997cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Supernode processing of mixed-integer models

  1994cited by this paper
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems

  1994cited by this paper
• SOLVING STRUCTURED 0/1 INTEGER PROGRAMS ARISING FROM TRUCK DISPATCHING SCHEDULING PROBLEMS.

  1993cited by this paper
• Facets for the Multiple Knapsack ProblemC

  1993cited by this paper
• Facets of Special Knapsack Equality Polytopes

  1993cited by this paper
• Solving airline crew scheduling problems by branch-and-cut

  1993cited by this paper
• Recent Developments and Future Directions in Mathematical Programming

  1992cited by this paper
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

  1991cited by this paper
• Solution of large-scale symmetric travelling salesman problems

  1991cited by this paper
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

  1991cited by this paper
• Twenty Years of Routing and Scheduling

  1990cited by this paper
• A branch-and-cut approach to a traveling salesman problem with side constraints

  1989cited by this paper
• VEHICLE ROUTING: METHODS AND STUDIES

  1988cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Vehicle Routing: Methods and Studies (Studies in Management Science and Systems, Volume 16)

  1988cited by this paper
• VEHICLE ROUTING WITH SITE DEPENDENCIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16

  1988cited by this paper
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models

  1985cited by this paper
• Solving Large-Scale Zero-One Linear Programming Problems

  1983cited by this paper
• Computing low-capacity 0–1 knapsack polytopes

  1982cited by this paper
• Lifting the facets of zero–one polytopes

  1978cited by this paper
• Technical Note - Facets and Strong Valid Inequalities for Integer Programs

  1976cited by this paper
• Further facet generating procedures for vertex packing polytopes

  1976cited by this paper
• A class of facet producing graphs for vertex packing polyhedra

  1975cited by this paper
• On certain polytopes associated with graphs

  1975cited by this paper
• On the facial structure of set packing polyhedra

  1973cited by this paper
• Some polyhedra related to combinatorial problems

  1969cited by this paper

• Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization

  2021cites this paper
• Incomplete MaxSAT Solving by Linear Programming Relaxation and Rounding

  2020cites this paper
• Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

  2019cites this paper
• Simulation-based optimization of truck-shovel material handling systems in multi-pit surface mines

  2019cites this paper
• Applications of simulation and optimization techniques in optimizing room and pillar mining systems

  2016cites this paper
• Multicriteria modeling and tradeoff analysis for oil load dispatch and hauling operations at Noble energy

  2015cites this paper
• Scheduling in the service industries: An overview

  2015cites this paper
• Faster separation of 1-wheel inequalities by graph products

  2015cites this paper
• Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model

  2014cites this paper
• Solving a woody biomass truck scheduling problem for a transport company in Western Oregon, USA.

  2012cites this paper
• THE THEORY OF SIMULTANEOUS LIFTING: CONSTELLATIONS IN CONFLICT HYPERGRAPHS

  2009cites this paper
• Resource constrained shortest paths and extensions

  2009cites this paper
• Combinatorial optimization and application to DNA sequence analysis

  2008cites this paper
• Operations Research Advances Cancer Therapeutics

  2008cites this paper
• OR PRACTICE - The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment

  2008cites this paper
• Facets of conflict hypergraphs

  2008cites this paper
• Design, simulation, analysis and optimization of transportation system for a biomass to ethanol conversion plant

  2007cites this paper
• Using Hyperstars to Create Facial-Defining Inequalities of General Binary Integer Programs

  2007cites this paper
• Classification and Disease Prediction Via Mathematical Programming

  2007cites this paper
• Solving a Mixed-Integer Programming Formulation of a Multi-Category Constrained Discrimination Model

  2006cites this paper
• Integer Programming for Telecommunications

  2006cites this paper
• Solving a mixed-integer programming formulation of a classification model with misclassification limits

  2005influential citation
• Facets of the independent set polytope

  2003cites this paper
• On identifying dominant cliques

  2003cites this paper
• Hybrid approaches to solve dynamic fleet management problems

  2003cites this paper
• Mixed Integer Programming Approaches to Treatment Planning for Brachytherapy – Application to Permanent Prostate Implants

  2003cites this paper
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem

  2002cites this paper
• A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems

  2001cites this paper
• COMPUTATIONAL EXPERIENCE OF AN INTERIOR-POINT SQP ALGORITHM IN A PARALLEL BRANCH-AND-BOUND FRAMEWORK

  2000cites this paper
• Computational experience with parallel mixed integerprogramming in a distributed environment

  1999cites this paper
• Branch-and-cut Algorithms for Integer Programming, Branch-and-cut

  1998cites this paper
• Computational Experience in Nonlinear Mixed Integer Programming

  1997cites this paper
• On Facets of Knapsack Equality Polytopes

  1997cites this paper
• Computational Experience of an Interior-Point Algorithm in a Parallel Branch-and-Cut Framework

  1997cites this paper
• On Facets of Knapsack Equality Polytopes

  1997cites this paper
• Branch-and-bound Methods for Integer Programming, Branch-and-bound

  year unknowncites this paper