Solving a truck dispatching scheduling problem using branch-and-cut

DOI10.1287/OPRE.46.3.355MaRDI QIDQ2781096zbMATH OpenOpenAlexFDO

Authors Eva K. Lee, Robert E. Bixby

Publication date 1 July 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/101808

zbMATH Keywords

0/1 integer programsbranch-and-cut IP solverknapsack equality constraintstruck dispatching scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On facets of knapsack equality polytopes
• A branch-and-cut algorithm for vehicle routing problems
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• A solution approach for log truck scheduling based on composite pricing and branch and bound
• A near-exact method for solving the log-truck scheduling problem

Cited in

(11)

• On facets of knapsack equality polytopes
• The Canadian minimum duration truck driver scheduling problem
• On identifying dominant cliques.
• Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
• Multicriteria modeling and tradeoff analysis for oil load dispatch and hauling operations at Noble energy
• Integrated shipment dispatching and packing problems: a case study
• Solving a multigroup mixed-integer programming-based constrained discrimination model
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
• Faster separation of 1-wheel inequalities by graph products
• Flow-based integer linear programs to solve the weekly log-truck scheduling problem

This page was built for publication: Solving a truck dispatching scheduling problem using branch-and-cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781096)