Pages that link to "Item:Q2781096"
From MaRDI portal
The following pages link to Solving a truck dispatching scheduling problem using branch-and-cut (Q2781096):
Displaying 11 items.
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (Q321126) (← links)
- Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
- Flow-based integer linear programs to solve the weekly log-truck scheduling problem (Q748554) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- The Canadian minimum duration truck driver scheduling problem (Q1761170) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization (Q2046309) (← links)
- Multicriteria modeling and tradeoff analysis for oil load dispatch and hauling operations at Noble energy (Q2357845) (← links)
- Integrated shipment dispatching and packing problems: a case study (Q2369964) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)