A surrogate and Lagrangian approach to constrained network problems
From MaRDI portal
Publication:920831
DOI10.1007/BF02216933zbMath0708.90026OpenAlexW2001965277MaRDI QIDQ920831
John J. Dinkel, John Mote, Munirpallam A. Venkataramanan
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02216933
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Calculating surrogate constraints
- The simplex SON algorithm for LP/embedded network problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Surrogate Constraint Duality in Mathematical Programming
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- Validation of subgradient optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Mathematical Programming
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
This page was built for publication: A surrogate and Lagrangian approach to constrained network problems
