Pages that link to "Item:Q1357786"
From MaRDI portal
The following pages link to A mixed-integer model for solving ordering problems with side constraints (Q1357786):
Displaying 11 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
- Clustered coverage orienteering problem of unmanned surface vehicles for water sampling (Q6072147) (← links)
- The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches (Q6102766) (← links)
