A surrogate and Lagrangian approach to constrained network problems
type: Item
instance of: scholarly article
title: A surrogate and Lagrangian approach to constrained network problems
zbMATH Open document ID: 0708.90026
DOI: 10.1007/BF02216933
author: John J. Dinkel
author: John Mote
author: Munirpallam A. Venkataramanan
published in: Annals of Operations Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 4164521
zbMATH Keywords: surrogate constraints
zbMATH Keywords: Lagrange multipliers
zbMATH Keywords: multiplier update procedure
zbMATH Keywords: advanced starting solutions
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: An improved version of the out-of-kilter method and a comparative study of computer codes
cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
cites work: A primal algorithm for solving a capacitated network flow problem with additional linear constraints
cites work: Calculating surrogate constraints
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Q4178782
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: The simplex SON algorithm for LP/embedded network problems
cites work: Surrogate Mathematical Programming
cites work: Validation of subgradient optimization
cites work: Q5623864
cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q4051876
cites work: Q3731376
cites work: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
full work available at URL: https://doi.org/10.1007/bf02216933
OpenAlex ID: W2001965277
Recommended article: Revisiting Lagrangian relaxation for network design
Recommended article: Survivable capacitated network design problem: new formulation and Lagrangean relaxation
Recommended article: An efficient method for nonlinearly constrained networks
Recommended article: A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
Recommended article: Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
Recommended article: Q2999651
Recommended article: Tutorial on surrogate constraint approaches for optimization in graphs
Recommended article: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
Recommended article: Exact stochastic constraint optimisation with applications in network analysis
description: scientific article; zbMATH DE number 4164521