Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
From MaRDI portal
Recommendations
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A new modeling and solution approach for the set-partitioning problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- An integral simplex algorithm for solving combinatorial optimization problems
- Benchmarking optimization software with performance profiles.
- Combinatorial optimization. Packing and covering
- Constraint handling in genetic algorithms: the set partitioning problem
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Edmonds polytopes and a hierarchy of combinatorial problems
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Odd Minimum Cut-Sets and b-Matchings
- On the facial structure of set packing polyhedra
- On the separation of maximally violated mod-\(k\) cuts
- Reducibility among combinatorial problems
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- Set Partitioning: A survey
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Cited in
(3)
This page was built for publication: Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160432)
