A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
type: Item
instance of: scholarly article
title: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
zbMATH Open document ID: 0857.90089
DOI: 10.1007/BF00127080
published in: Journal of Heuristics
publication date: 1996-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 922555
zbMATH Keywords: preprocessing
zbMATH Keywords: set partitioning
zbMATH Keywords: approximation algorithm
zbMATH Keywords: problem size-reduction
zbMATH Keywords: cost perturbations
zbMATH Keywords: Lagrangian dual framework
zbMATH Keywords: cutting planes
author: Alper Atamtürk
author: G. L. Nemhauser
author: Martin W. P. Savelsbergh
describes a project that uses: MIPLIB
describes a project that uses: MINTO
MaRDI profile type: Publication
cites work: Set Partitioning: A survey
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut
cites work: MINTO, a Mixed INTeger Optimizer
cites work: On the facial structure of set packing polyhedra
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
full work available at URL: https://doi.org/10.1007/bf00127080
OpenAlex ID: W1977000744
description: scientific article; zbMATH DE number 922555