Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019
From MaRDI portal
Publication:6092663
Recommendations
- Searching for optimal integer solutions to set partitioning problems using column generation
- Complementary column generation and bounding approaches for set partitioning formulations
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- Distributed integral column generation for set partitioning problems
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Very large-scale neighborhood search for the multidimensional assignment problem
- Constraint-based very large-scale neighborhood search
Cites work
- A survey on matheuristics for routing problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Branch-and-price: Column generation for solving huge integer programs
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 6865614 (Why is no real title available?)
- Optimization by simulated annealing
- Rich vehicle routing problems: from a taxonomy to a definition
- The truck dispatching problem
- Vehicle Routing
Cited in
(2)
This page was built for publication: Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092663)