A mixed-integer model for solving ordering problems with side constraints
From MaRDI portal
Recommendations
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- On dual based lower bounds for the sequential ordering problem with precedences and due dates
- Local search procedures for improving feasible solutions to the sequential ordering problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
Cited in
(12)- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Models and algorithms for the traveling salesman problem with time-dependent service times
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
- scientific article; zbMATH DE number 2159167 (Why is no real title available?)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- A branch-and-cut framework for the consistent traveling salesman problem
- Solving a school bus scheduling problem with integer programming
- Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
- The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Projection results for vehicle routing
This page was built for publication: A mixed-integer model for solving ordering problems with side constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357786)
