Valid Inequalities and Separation Algorithms for the Set Partitioning Problem

DOI10.3138/infor.52.4.185MaRDI QIDQ6160432

Guy Desaulniers, Odile Marcotte, Mounira Groiez

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

cutting planescliqueset partitioningseparation algorithmrank-1 Chvátal-Gomory inequalities

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A scheme for determining vehicle routes based on Arc-based service network design

Cites Work

• Unnamed Item
• Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• Geometric algorithms and combinatorial optimization.
• An integral simplex algorithm for solving combinatorial optimization problems
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the separation of maximally violated mod-\(k\) cuts
• A new modeling and solution approach for the set-partitioning problem
• Edmonds polytopes and a hierarchy of combinatorial problems
• Constraint handling in genetic algorithms: the set partitioning problem
• Combinatorial Optimization
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Odd Minimum Cut-Sets and b-Matchings
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Set Partitioning: A survey
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Reducibility among Combinatorial Problems
• On the facial structure of set packing polyhedra
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Maximum matching and a polyhedron with 0,1-vertices
• Benchmarking optimization software with performance profiles.

This page was built for publication: Valid Inequalities and Separation Algorithms for the Set Partitioning Problem