Use of hidden network structure in the set partitioning problem

DOI10.1007/3-540-59408-6_50zbMath1498.90179OpenAlexW1780336397MaRDI QIDQ5101414

Jeffrey L. Kennington, Agha Iqbal Ali, Hyun-Soo Han

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_50

zbMATH Keywords

integer programmingnetworkstransformationset partitioningsubmatrix

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A network relaxation based enumeration algorithm for set partitioning
• An efficient PQ-graph algorithm for solving the graph-realization problem
• A good submatrix is hard to find
• Automatic identification of embedded network rows in large-scale optimization models
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Extracting embedded generalized networks from linear programming problems
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• A note on some computationally difficult set covering problems
• Cutting planes from conditional bounds: A new approach to set covering
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Identification of special structure constraints in linear programs
• Optimal set partitioning, matchings and lagrangian duality
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• An Algorithm for Large Set Partitioning Problems
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Flight Crew Scheduling
• On the facial structure of set packing polyhedra