Lagrangean relaxation. (With comments and rejoinder).

From MaRDI portal

Publication:1876461

Jump to:navigation, search

DOI10.1007/BF02579036zbMath1079.90087MaRDI QIDQ1876461

Monique Guignard

Publication date: 7 September 2004

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

integer programming column generation Lagrangean relaxation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A Lagrangean decomposition for the maximum independent set problem applied to map labeling, Tight bounds from a path based formulation for the tree of hub location problem, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, Consistency Cuts for Dantzig-Wolfe Reformulations, An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search, Stochastic hub location problems with Bernoulli demands, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, Incorporating location, inventory and price decisions into a supply chain distribution network design problem, An exact algorithm for the modular hub location problem with single assignments, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization, Calculating the best dual bound for problems with multiple Lagrangian relaxations, Cluster Lagrangean decomposition in multistage stochastic optimization, A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO\(_2\) emissions, Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach, Optimizing production capacity and safety stocks in general acyclic supply chains, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, The single period coverage facility location problem: Lagrangean heuristic and column generation approaches, Lagrangean bounds for the optimum communication spanning tree problem, Discrete location for bundled demand points, An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse, Matheuristics: survey and synthesis, Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, Use of Lagrangian decomposition in supply chain planning, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, Refinement of Lagrangian bounds in optimization problems, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem, Large-scale unit commitment under uncertainty: an updated literature survey, Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment, Natalie 2.0: sparse global network alignment as a special case of quadratic assignment, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Fixed cardinality stable sets, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, Decomposition methods for the two-stage stochastic Steiner tree problem, A parallelized lagrangean relaxation approach for the discrete ordered median problem, Integrated hub location and flow processing schedule problem under renewable capacity constraint, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures, Risk management for forestry planning under uncertainty in demand and prices, Multi-period stochastic covering location problems: modeling framework and solution approach, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty, An homage to Joseph-Louis Lagrange and Pierre Huard, Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, A dual bounding scheme for a territory design problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables, Decomposition and dynamic cut generation in integer linear programming, A Lagrangian bound for many-to-many assignment problems, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Studying properties of Lagrangian bounds for many-to-many assignment problems, Stochastic set packing problem, Divide to conquer: decomposition methods for energy optimization, A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem, Train timetabling for an urban rail transit line using a Lagrangian relaxation approach, Hub-and-spoke network design and fleet deployment for string planning of liner shipping, Management of wind power variations in electricity system investment models. A parallel computing strategy, A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints, A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Lagrangian relaxation of the generic materials and operations planning model, Modeling and Managing Uncertainty in Process Planning and Scheduling, On the complexity of surrogate and group relaxation for integer linear programs, The radar method: An effective line search for piecewise linear concave functions, Lagrangean relaxation for the capacitated hub location problem with single assignment, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, New approaches for optimizing over the semimetric polytope, Large-scale unit commitment under uncertainty, About Lagrangian methods in integer optimization, Non delayed relax-and-cut algorithms

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1876461&oldid=14269974"