Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

DOI10.1287/MOOR.1070.0250MaRDI QIDQ5388043zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Marco Di Summa, Giacomo Zambelli

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1070.0250

zbMATH Keywords

set partitioningbalanced matricesinfeasible systems of linear inequalities

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Minimal infeasible constraint sets in convex integer programs
• Identifying Minimally Infeasible Subsystems of Inequalities
• A note on resolving infeasibility in linear programs by constraint relaxation
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• scientific article; zbMATH DE number 30950

Cited in

(5)

• An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
• Exactly hittable interval graphs
• Simultaneous node and link districting in transportation networks: model, algorithms and railway application
• The balance problem of min-max systems is co-nNP hard
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm

This page was built for publication: Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388043)