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

DOI10.1287/opre.46.3.355zbMath0987.90034OpenAlexW2124274583MaRDI QIDQ2781096

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

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

Related Items (6)

Multicriteria modeling and tradeoff analysis for oil load dispatch and hauling operations at Noble energy ⋮ On facets of knapsack equality polytopes ⋮ Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model ⋮ Faster separation of 1-wheel inequalities by graph products ⋮ Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization ⋮ On identifying dominant cliques.

This page was built for publication: Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut