A parallel, linear programming-based heuristic for large-scale set partitioning problems

DOI10.1287/IJOC.13.3.191.12630MaRDI QIDQ2884506zbMATH OpenOpenAlexFDO

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

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) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• scientific article; zbMATH DE number 1054926
• On some difficult linear programs coming from set partitioning
• Large-scale 0-1 linear programming on distributed workstations
• scientific article; zbMATH DE number 2227477

Cited in

(12)

• A concurrent processing framework for the set partitioning problem
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Integral simplex using double decomposition for set partitioning problems
• A new modeling and solution approach for the set-partitioning problem
• Parametric cardinality probing in set partitioning
• A dual ascent procedure for the set partitioning problem
• The matching relaxation for a class of generalized set partitioning problems
• Solving graph partitioning problems with parallel metaheuristics
• Modelling transfer line design problem via a set partitioning problem
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
• On parallelizing a greedy heuristic for finding small dominant sets

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A parallel, linear programming-based heuristic for large-scale set partitioning problems

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