Convergent Lagrangian heuristics for nonlinear minimum cost network flows

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
The Lagrangian Relaxation Method for Solving Integer Programming Problems
A survey on the continuous nonlinear resource allocation problem
Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Monotone networks
A polynomially bounded algorithm for a singly constrained quadratic program
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
Computational development of a lagrangian dual approach for quadratic networks
An O(n) algorithm for quadratic knapsack problems
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
On the convergence properties of the projected gradient method for convex optimization
Iterative Methods for Large Convex Quadratic Programs: A Survey
Relaxation Methods for Network Flow Problems with Convex Arc Costs
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
On the dual coordinate ascent approach for nonlinear networks

Cited In (4)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
Resource-constrained management of heterogeneous assets with stochastic deterioration
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

Uses Software

NETGEN

   Recommendations

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem 👍 👎
A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems 👍 👎
Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods 👍 👎
Computational development of a lagrangian dual approach for quadratic networks 👍 👎
A surrogate and Lagrangian approach to constrained network problems 👍 👎

This page was built for publication: Convergent Lagrangian heuristics for nonlinear minimum cost network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480971)