Layering strategies for creating exploitable structure in linear and integer programs

No abstract is available for this paper.

• Publication year

  1988

• Venue

  Mathematical programming

• Publication date

  1988-01-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF01580728
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The equal flow problem

  1988cited by this paper
• An Almost Linear-Time Algorithm for Graph Realization

  1988cited by this paper
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

  1987cited by this paper
• Computational comparison of two solution procedures for allocation/processing networks

  1986cited by this paper
• A Primal Simplex Approach to Pure Processing Networks

  1986cited by this paper
• Extracting embedded generalized networks from linear programming problems

  1985cited by this paper
• Minimal Cost Flow in Processing Networks, a Primal Approach

  1985cited by this paper
• Recent Algorithms for Two Versions of Graph Realization and Remarks on Applications to Linear Programming

  1984cited by this paper
• A Netform System for Resource Planning in the U.S. Bureau of Land Management

  1984cited by this paper
• An operational approach to integrated working capital planning

  1983cited by this paper
• A Linear Programming/Network Model for Vegetation Allocation

  1983cited by this paper
• An almost linear-time graph realization algorithm

  1983cited by this paper
• Efficient Tree Handling Procedures for Allocation/Processing Networks.

  1982cited by this paper
• CREATING NETWORK STRUCTURE IN LP'S

  1981cited by this paper
• An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem

  1980cited by this paper
• Network Flow Programming

  1980cited by this paper
• Technical Note - Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks

  1980cited by this paper
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem

  1980cited by this paper
• Converting Linear Programs to Network Problems

  1980cited by this paper
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems

  1980cited by this paper
• A Study of Alternative Relaxation Approaches for a Manpower Planning Problem.

  1979cited by this paper
• Improved Computer-Based Planning Techniques. Part II

  1979cited by this paper
• Feature Article - Energy Policy Modeling: A Survey

  1979cited by this paper
• Generalized Networks: A Fundamental Computer-Based Planning Tool

  1978cited by this paper
• Network Application in Industry and Government

  1977cited by this paper
• A Policy Evaluation Model and Prototype Computer-Assisted Policy Evaluation System for Naval Personnel Management.

  1977cited by this paper
• Linear programming : methods and applications / Saul L. Gass

  1975cited by this paper
• Validation of subgradient optimization

  1974cited by this paper
• Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems

  1973cited by this paper
• Principles of Operations Research

  1972cited by this paper
• Linear Programming: Methods and Applications

  1970cited by this paper
• Fundamentals of Network Analysis

  1969cited by this paper
• Surrogate Constraints

  1968cited by this paper
• Linear programming and extensions

  1965cited by this paper
• Flows in Networks

  1963cited by this paper
• Principles of operations research

  1954cited by this paper

• The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations

  2025cites this paper
• A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution

  2023cites this paper
• Consistency Cuts for Dantzig-Wolfe Reformulations

  2021cites this paper
• Modelling and Optimisation of Renewable Energy Systems

  2015cites this paper
• Integration and coordination of supply chain: Case studies in the forestry and petroleum industries

  2012cites this paper
• Metaheuristics 1

  2011cites this paper
• Use of Lagrangian decomposition in supply chain planning

  2011cites this paper
• Reconstructing (0,1)-matrices from projections using integer programming

  2009cites this paper
• Using scenario trees and progressive hedging for stochastic inventory routing problems

  2009cites this paper
• Coordination of refinery production and sales planning

  2008cites this paper
• SNF Report No . 26 / 08 Coordination of refinery production and sales planning

  2008cites this paper
• Solving a multi-period supply chain problem for a pulp company using heuristics—An application to Södra Cell AB

  2008cites this paper
• En hommage à Joseph-Louis Lagrange et à Pierre Huard

  2007cites this paper
• Working PaperConstraint Aggregation Principlein Convex

  2007cites this paper
• Lagrange-Ansätze zur Lösung des Transportproblems mit Fixkosten

  2005cites this paper
• Tutorial on Surrogate Constraint Approaches for Optimization in Graphs

  2003cites this paper
• Lagrangean Tabu Search

  2002cites this paper
• Introduction to Block Integer Programming

  2001cites this paper
• Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems

  1998cites this paper
• Constraint aggregation principle in convex optimization

  1997cites this paper
• Column generation applied to linear programs in course registration

  1995cites this paper
• Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)

  1994cites this paper
• A fast algorithm for bounded generalized processing networks

  1994cites this paper
• Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering

  1994cites this paper
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing proble

  1993cites this paper
• An improved bounding procedure for the constrained assignment problem

  1991cites this paper
• Netform Modeling and Applications

  1990cites this paper
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem

  1990cites this paper
• A survey of dynamic network flows

  1989cites this paper
• An application-oriented guide for designing Lagrangean dual ascent algorithms

  1989cites this paper
• On solving structured integer programming problems with Lagrangean relaxation and/or decomposition

  1989cites this paper
• Network models with generalized upper bound side constraints

  1989cites this paper
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

  1987cites this paper
• Lagrangean decomposition for integer programming: theory and applications

  1987cites this paper
• Future paths for integer programming and links to artificial intelligence

  1986cites this paper
• Artificial Intelligence Based Metaheuristic Computational Approach for Solving Multi-Level Linear and Non-linear Programming Problems Using Fuzzy Genetic Algorithm.

  year unknowncites this paper