Lagrangian Relaxation for Integer Programming

By A. M. Geoffrion. 50 Years of Integer Programming, 2010

614 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Structured Learning and Prediction in Computer Vision (2011, neutral): “The definition is due to Geoffrion [50].”
Stochastic dual dynamic integer programming (2018, neutral): “Then, we have the following equalities: where (4.5) follows from Theorem 1 in [32] (also c.f. Theorem 6.2 in [59]).”
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, methodology): “We will need the following theorem, whose proof can be found in textbooks such as [45].”
Diverse M-Best Solutions in Markov Random Fields (2012, background): “1 Interactive segmentation Interactive segmentation is a task where a user is interested in cutting out a foreground object of interest from an image via annotations like scribbles [6] or a coarse bounding box [29].”
Multi-phase dynamic constraint aggregation for set partitioning type problems (2010, methodology): “Given a minimization LP, Lagrangian relaxation [ 14 ] transfers, using Lagrangian multipliers, a subset of the constraints into the objective function to define a subproblem.”