scientific article
From MaRDI portal
Publication:3730365
zbMath0596.90091MaRDI QIDQ3730365
Michel Minoux, Celso Carneiro Ribeiro
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrangean relaxationbranch-and-boundlower boundsequality constrained knapsackdoubly constrained shortest path
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Lagrangean decomposition: A model yielding stronger lagrangean bounds, Improved Lagrangean decomposition: An application to the generalized assignment problem, An homage to Joseph-Louis Lagrange and Pierre Huard, Effective Algorithms for a Class of Discrete Valued Optimal Control Problems, An application-oriented guide for designing Lagrangean dual ascent algorithms
