A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems

DOI10.1287/ijoc.13.3.191.12630zbMath1238.90114OpenAlexW2171886963MaRDI QIDQ2884506

Savelsbergh, Martin W. P., Jeff Linderoth, Eva K. Lee

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6a5cd417a73d6590b1e3a0d2994604705441f52d

zbMATH Keywords

parallel computingset partitioninglinear programming-based heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Related Items (8)

The matching relaxation for a class of generalized set partitioning problems ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Solving Graph Partitioning Problems with Parallel Metaheuristics ⋮ A new modeling and solution approach for the set-partitioning problem ⋮ A dual ascent procedure for the set partitioning problem ⋮ Modelling transfer line design problem via a set partitioning problem ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM

Uses Software

• TSPLIB

This page was built for publication: A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems