A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi

Source URL: www.math.nus.edu.sg

MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation J¨ org Hendrik Kappes, Stefan Schmidt, and Christoph Schn¨orr Image and Pattern Analysis Group & HCI, University of Heidelberg, Germany, {kappes,schm

Source URL: ipa.iwr.uni-heidelberg.de

Lagrangian Relaxation in CP Willem-Jan van Hoeve CPAIOR 2016 Master Class Tepper School of Business • William Larimer Mellon Founder

Source URL: www.andrew.cmu.edu

CS261: A Second Course in Algorithms Lecture #8: Linear Programming Duality (Part 1)∗ Tim Roughgarden† January 28,

Source URL: theory.stanford.edu

• Mathematical optimization
• Operations research
• Convex optimization
• Linear programming
• Mathematical analysis
• Duality
• Constraint
• Feasible region
• Semidefinite programming
• Lagrangian relaxation

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Source URL: ceur-ws.org

• Operations research
• Mathematical optimization
• Search algorithms
• NP-complete problems
• Combinatorial optimization
• Variable neighborhood search
• Vehicle routing problem
• Travelling salesman problem
• Heuristic
• A* search algorithm
• Lagrangian relaxation
• Local search

Preprint ANL/MCS-P4030AN AUGMENTED INCOMPLETE FACTORIZATION APPROACH FOR COMPUTING THE SCHUR COMPLEMENT IN STOCHASTIC OPTIMIZATION § ¨

Source URL: www.mcs.anl.gov

• Mathematical optimization
• Operations research
• Numerical linear algebra
• Stochastic programming
• Conjugate gradient method
• Matrix
• Linear programming
• Benders decomposition
• Preconditioner
• Equation solving
• Relaxation
• Augmented Lagrangian method

Decision-aid Methodology for the School Bus Routing and Scheduling Problem Michela Spada, ROSO-IMA-EPFL Michel Bierlaire, ROSO-IMA-EPFL Thomas Liebling, ROSO-IMA-EPFL

Source URL: www.strc.ch

• Operations research
• Combinatorial optimization
• Mathematical optimization
• NP-complete problems
• Travelling salesman problem
• Integer programming
• School bus
• Branch and bound
• Bus
• Heuristic
• Lagrangian relaxation

Decomposition and Dynamic Cut Generation in Integer Programming: Theory and Algorithms T.K. Ralphs∗ M.V. Galati†

Source URL: coral.ie.lehigh.edu

• Convex optimization
• Relaxation
• Combinatorial optimization
• Cutting-plane method
• Decomposition method
• Linear programming relaxation
• Lagrangian relaxation
• Dantzig–Wolfe decomposition
• Linear programming
• Mathematical optimization
• Mathematics
• Operations research

Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs∗ M.V. Galati†

Source URL: coral.ie.lehigh.edu

• Relaxation
• Linear programming
• Cutting-plane method
• Dantzig–Wolfe decomposition
• Lagrangian relaxation
• Decomposition method
• Mathematical optimization
• Convex optimization
• Operations research

On the Capacitated Vehicle Routing Problem∗ T.K. Ralphs†, L. Kopman‡, W.R. Pulleyblank§, and L.E. Trotter, Jr.¶ Revised December 17, 2001 Abstract We consider the Vehicle Routing Problem, in which a fixed fleet o

Source URL: coral.ie.lehigh.edu

• Applied mathematics
• Convex optimization
• Relaxation
• Linear programming
• Travelling salesman problem
• Lagrangian relaxation
• Simplex algorithm
• Mathematical optimization
• Operations research
• Mathematics