On some difficult linear programs coming from set partitioning
type: Item
instance of: scholarly article
title: On some difficult linear programs coming from set partitioning
zbMATH Open document ID: 0995.90069
DOI: 10.1016/S0166-218X(01)00252-9
author: Francisco Barahona
author: Ranga Anbil
published in: Discrete Applied Mathematics
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 1741961
zbMATH Keywords: subgradient algorithm
zbMATH Keywords: volume algorithm
zbMATH Keywords: large scale linear progamming
describes a project that uses: OSL
MaRDI profile type: Publication
cites work: A generalization of Polyak's convergence result for subgradient optimization
cites work: A global approach to crew-pairing optimization
cites work: Accelerating the convergence of subgradient optimisation
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: On the choice of step size in subgradient optimization
cites work: Q4133397
cites work: A Heuristic Method for the Set Covering Problem
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: Q4105990
cites work: Q5574366
cites work: The Set-Covering Problem: A New Implicit Enumeration Algorithm
cites work: On convergence rates of subgradient optimization methods
cites work: Q3334893
cites work: Q3840370
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Validation of subgradient optimization
cites work: Variable target value subgradient method
cites work: The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
cites work: The efficiency of ballstep subgradient level methods for convex optimization
cites work: Q3200888
cites work: Q4040780
cites work: Q3686444
cites work: Q5566712
cites work: Minimization of unsmooth functionals
cites work: Q5187067
cites work: Q4146571
Recommended article: Linear programming formulation of the set partitioning problem
Recommended article: Q4395415
Recommended article: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Recommended article: An extension of set partitioning with application to scheduling problems
Recommended article: Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
Recommended article: Q4519302
Recommended article: Linear and quadratic programming approaches for the general graph partitioning problem
Recommended article: Q3338296
description: scientific article; zbMATH DE number 1741961