About Lagrangian methods in integer optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3628723
- Lagrangian relaxation for integer programming
- scientific article; zbMATH DE number 3858858
- scientific article; zbMATH DE number 3614502
- Lagrangean decomposition for integer programming : theory and applications
- A nonlinear Lagrangian dual for integer programming
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- scientific article; zbMATH DE number 3993318
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- scientific article; zbMATH DE number 4115852
Cites work
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3634029 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 1568985 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 915582 (Why is no real title available?)
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A geometric study of dual gaps, with applications
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- An exponential‐function reduction method for block‐angular convex programs
- Bounds for probabilistic integer programming problems
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Combinatorial approaches to multiflow problems
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Decomposition Principle for Linear Programs
- Discrete facility location and routing of obnoxious activities.
- Dual-ascent methods for large-scale multicommodity flow problems
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Generalized Bundle Methods
- Geometry of cuts and metrics
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- Multicommodity network flows: The impact of formulation on decomposition
- New approaches for optimizing over the semimetric polytope
- New bundle methods for solving Lagrangian relaxation dual problems
- New variants of bundle methods
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- On improvements to the analytic center cutting plane method
- Partitioning procedures for solving mixed-variables programming problems
- Progress Made in Solving the Multicommodity Flow Problem
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Stochastic programming with integer variables
- Subgradient Methods for the Service Network Design Problem
- The Cutting-Plane Method for Solving Convex Programs
- The traveling-salesman problem and minimum spanning trees: Part II
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- Validation of subgradient optimization
Cited in
(51)- Minimizing value-at-risk in single-machine scheduling
- A stabilized structured Dantzig-Wolfe decomposition method
- Computation of approximate -points for large scale single machine scheduling problem
- New approaches for optimizing over the semimetric polytope
- Large-scale unit commitment under uncertainty: an updated literature survey
- Electric power infrastructure planning under uncertainty: stochastic dual dynamic integer programming (SDDiP) and parallelization scheme
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- Incremental bundle methods using upper models
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- A two-echelon multi-trip vehicle routing problem with synchronization for an integrated water- and land-based transportation system
- The omnipresence of Lagrange
- The min-up/min-down unit commitment polytope
- On the augmented Lagrangian dual for integer programming
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Consensus-based Dantzig-Wolfe decomposition
- Refinement of Lagrangian bounds in optimization problems
- A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
- Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Deterministic electric power infrastructure planning: mixed-integer programming model and nested decomposition algorithm
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Lagrangian heuristic for a class of the generalized assignment problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Large-scale unit commitment under uncertainty
- A Lagrangian bound for many-to-many assignment problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- A new cross decomposition method for stochastic mixed-integer linear programming
- A multiperiod drayage problem with customer-dependent service periods
- A Lagrangian approach to chance constrained routing with local broadcast
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- Solving a dynamic facility location problem with partial closing and reopening
- Calculating the best dual bound for problems with multiple Lagrangian relaxations
- Time-flexible min completion time variance in a single machine by quadratic programming
- A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- On the choice of explicit stabilizing terms in column generation
- Lagrangian relaxation for airport gate assignment problem
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- On parallelizing dual decomposition in stochastic integer programming
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- scientific article; zbMATH DE number 3628723 (Why is no real title available?)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- The vehicle routing problem with floating targets: formulation and solution approaches
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
- pth power Lagrangian method for integer programming
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- On the complexity of the unit commitment problem
- Towards strong duality in integer programming
- On solving the Lagrangian dual of integer programs via an incremental approach
This page was built for publication: About Lagrangian methods in integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817183)
