Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

DOI10.1287/moor.1070.0250zbMath1279.90143OpenAlexW2141875770MaRDI QIDQ5388043

Marco Di Summa, Giacomo Zambelli, Michele Conforti

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)

Related Items (2)

Simultaneous node and link districting in transportation networks: model, algorithms and railway application ⋮ 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