Layering strategies for creating exploitable structure in linear and integer programs

DOI10.1007/BF01580728zbMath0667.90070MaRDI QIDQ1117840

Fred Glover, Darwin D. Klingman

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

parallel processingsubgradientlayerssplitting variablesmodified relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Nonsmooth analysis (49J52) Linear programming (90C05) Theory of operating systems (68N25)

Related Items (17)

Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Constraint aggregation principle in convex optimization ⋮ Polyhedral analysis and decompositions for capacitated plant location-type problems ⋮ Column generation applied to linear programs in course registration ⋮ Use of Lagrangian decomposition in supply chain planning ⋮ A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution ⋮ Lagrangean decomposition: A model yielding stronger lagrangean bounds ⋮ A survey of dynamic network flows ⋮ An improved bounding procedure for the constrained assignment problem ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Reconstructing (0,1)-matrices from projections using integer programming ⋮ An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem ⋮ Future paths for integer programming and links to artificial intelligence ⋮ An application-oriented guide for designing Lagrangean dual ascent algorithms ⋮ Using scenario trees and progressive hedging for stochastic inventory routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equal flow problem
• An efficient PQ-graph algorithm for solving the graph-realization problem
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Extracting embedded generalized networks from linear programming problems
• Computational comparison of two solution procedures for allocation/processing networks
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Validation of subgradient optimization
• Surrogate Constraints

This page was built for publication: Layering strategies for creating exploitable structure in linear and integer programs