Column generation for bi-objective vehicle routing problems with a MIN-MAX objective
From MaRDI portal
Recommendations
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
- An exact column generation-based algorithm for bi-objective vehicle routing problems
- Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
- Vehicle routing via column generation
Cited in
(10)- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
- An exact column generation-based algorithm for bi-objective vehicle routing problems
- A column generation approach for an emission-oriented vehicle routing problem on a multigraph
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- Branch-and-bound for bi-objective integer programming
- Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
- Benders decomposition for bi-objective linear programs
This page was built for publication: Column generation for bi-objective vehicle routing problems with a MIN-MAX objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397851)
