Keyword

cutting plane method

Description: The cutting plane method is an optimization technique that iteratively adds constraints to strengthen a mathematical program’s feasible-region description.

Primary topic: Advanced Optimization Algorithms Research (29%)

Wikidata ID: wiki/Q1762039

OpenAlex ID: keywords/cutting-plane-method

Convex analysis and minimization algorithms

1993 · Jean‐Baptiste Hiriart‐Urruty, Claude Lemaréchal · 2,378

Large Margin Methods for Structured and Interdependent Output Variables

2005 · Ioannis Tsochantaridis, Thorsten Joachims, et al. · MPG.PuRe (Max Planck Society) · 1,878

PDF

Solving two-stage robust optimization problems using a column-and-constraint generation method

2013 · Bo Zeng, Long Zhao · Operations Research Letters · 1,808

The Cutting-Plane Method for Solving Convex Programs

1960 · J. E. Kelley, Jr. · Journal of the Society for Industrial and Applied Mathematics · 1,561

Support vector machine learning for interdependent and structured output spaces

2004 · Ioannis Tsochantaridis, Thomas Hofmann, et al. · 1,250

PDF

Convex Optimization: Algorithms and Complexity

2015 · Sébastien Bubeck · Foundations and Trends® in Machine Learning · 1,242

PDF

Tabu Search: A Tutorial

1990 · Fred Glover · INFORMS Journal on Applied Analytics · 1,118

Cutting-plane training of structural SVMs

2009 · Thorsten Joachims, Thomas Finley, et al. · Machine Learning · 959

PDF

A Computational Study of the Job-Shop Scheduling Problem

1991 · David Applegate, William Cook · INFORMS journal on computing · 909

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

1981 · T. L. Magnanti, R. T. Wong · Operations Research · 732

A lift-and-project cutting plane algorithm for mixed 0–1 programs

1993 · Egon Balas, Sebastián Ceria, et al. · Mathematical Programming · 720

Generalized Fisher Score for Feature Selection

2012 · Gu, Quanquan, Li, Zhenhui, et al. · arXiv (Cornell University) · 561

PDF

The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

1961 · J. B. Rosen · Journal of the Society for Industrial and Applied Mathematics · 520

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

1988 · Francisco Barahona, Martin Grötschel, et al. · Operations Research · 504

Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse

1991 · Julia L. Higle, Suvrajeet Sen · Mathematics of Operations Research · 452

Design of Survivable Networks

1992 · Mechthild Stoer · Lecture notes in mathematics · 373

Computational results with a branch and cut code for the capacitated vehicle routing problem

1998 · P. Augerat, Denis Naddef, et al. · 370

An extended cutting plane method for solving convex MINLP problems

1995 · Tapio Westerlund, Frank Pettersson · Computers & Chemical Engineering · 366

On an Integer Program for a Delivery Problem

1964 · M. L. Balinski, R. E. Quandt · Operations Research · 360

An Algorithm for the Mixed Integer Problem

1960 · Ralph E. Gomory · 352

Optimization—Theory and Practice

2010 · Wilhelm Forst, Dieter Hoffmann · Springer undergraduate texts in mathematics and technology · 319

A Cutting Plane Algorithm for the Linear Ordering Problem

1984 · Martin Grötschel, Michael Jünger, et al. · Operations Research · 318

A cutting plane algorithm for a clustering problem

1989 · M. Grötschel, Y. Wakabayashi · Mathematical Programming · 311

Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality

1980 · Harlan Crowder, Manfred W. Padberg · Management Science · 294

Discriminative models for multi-class object layout

2009 · Chaitanya Desai, Deva Ramanan, et al. · IEEE International Conference on Computer Vision (ICCV) · 281

Works count: 2,735

Citation count: 58,940