Lagrangean decomposition for integer programming : theory and applications
From MaRDI portal
Publication:3780006
DOI10.1051/ro/1987210403071zbMath0638.90075OpenAlexW2468321705MaRDI QIDQ3780006
Publication date: 1987
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104926
dualitylayeringmixed-integer programmingfacetssubtour elimination constraintsvariable splittingimplicit constraintsLagrangean decompositioninteger polytopesdecomposition in the Lagrangean relaxationmatching inequalities
Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27) Duality theory (optimization) (49N15) Decomposition methods (49M27) Polytopes and polyhedra (52Bxx)
Related Items
A Lagrangean decomposition solution to a single line multiproduct scheduling problem, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, Polyhedral analysis and decompositions for capacitated plant location-type problems, Lagrangean decomposition for integer nonlinear programming with linear constraints, The multi-hour service system design problem, An homage to Joseph-Louis Lagrange and Pierre Huard, Solving makespan minimization problems with Lagrangean decomposition, A novel analytical integer optimization method for wavelet based subband coding, The return plant location problem: Modelling and resolution, A primal-proximal heuristic applied to the French unit-commitment problem, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, A comparison of heuristics and relaxations for the capacitated plant location problem, Facility location with increasing production costs, \(\gamma\)-robust facility relocation problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
