Ask
Search
My library

About
Statistics
Contact
Data Protection
Accessibility
Imprint
Changelog
Frontend: v1.31.3
Backend: v1.11.4

We use cookies to provide a better user experience.

Data Protection

On cutting-plane proofs in combinatorial optimization

Chvatal, V.
Cook, W.
Hartmann, M.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

Publication date

January 1987

Abstract

SIGLETIB Hannover: RN 4052(87452-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Extracted data

Related items

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

The Cutting Plane Method is Polynomial for Perfect Matchings ∗

Karthekeyan Ch

August 2016

The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...

Design and Verify — A New Scheme for Generating Cutting-Planes —

Santanu S. Dey, et al.

January 2010

A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-bo...

On the complexity of cutting-plane proofs

Cook, William
Coullard, Collette R.
Turan, Gyoergy

January 1985

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Practical problem solving with cutting plane algorithms in combinatorial optimization

Juenger, M.
Thienel, S. (Koeln Univ. (Germany). Inst. fuer Informatik)
Reinelt, G. (Heidelberg Univ. (Germany). Inst. fuer Angewandte Mathematik)
Koeln Univ. (Germany). Angewandte Mathematik und Informatik

January 1994

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

Cutting planes in combinatorics

Chvatal, V.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization

Michael Jünger
Gerhard Reinelt
Stefan Thienel

January 1994

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

On cutting-plane proofs in combinatorial optimization

Chvátal, V.
Cook, W.
Hartmann, M.

April 1989

AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...

Combining logic and optimization in cutting plane theory

Bockmayr, Alexander
Eisenbrand, Friedrich

January 2000

Colloque avec actes et comité de lecture. internationale.International audienceCutting planes were i...

Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization

Jünger, Michael
Reinelt, Gerhard
Thienel, Stefan

January 1995

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

Cutting Planes and Integrality of Polyhedra: Structure and Complexity

Dabeen Lee (4937065)

August 2019

In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...

Cutting Planes in Combinatorics

Chvátal, V.

September 1985

In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin
Holland, Olaf

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

The Cutting Plane Method is Polynomial for Perfect Matchings ∗

Karthekeyan Ch

August 2016

The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...

Design and Verify — A New Scheme for Generating Cutting-Planes —

Santanu S. Dey, et al.

January 2010

A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-bo...

On the complexity of cutting-plane proofs

Cook, William
Coullard, Collette R.
Turan, Gyoergy

January 1985

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Practical problem solving with cutting plane algorithms in combinatorial optimization

Juenger, M.
Thienel, S. (Koeln Univ. (Germany). Inst. fuer Informatik)
Reinelt, G. (Heidelberg Univ. (Germany). Inst. fuer Angewandte Mathematik)
Koeln Univ. (Germany). Angewandte Mathematik und Informatik

January 1994

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

Cutting planes in combinatorics

Chvatal, V.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization

Michael Jünger
Gerhard Reinelt
Stefan Thienel

January 1994

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

On cutting-plane proofs in combinatorial optimization

Chvátal, V.
Cook, W.
Hartmann, M.

April 1989

AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...

Combining logic and optimization in cutting plane theory

Bockmayr, Alexander
Eisenbrand, Friedrich

January 2000

Colloque avec actes et comité de lecture. internationale.International audienceCutting planes were i...

Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization

Jünger, Michael
Reinelt, Gerhard
Thienel, Stefan

January 1995

Cutting plane algorithms have turned out to be practically successful computational tools in combina...

Cutting Planes and Integrality of Polyhedra: Structure and Complexity

Dabeen Lee (4937065)

August 2019

In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...

Cutting Planes in Combinatorics

Chvátal, V.

September 1985

In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin
Holland, Olaf

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

A cutting plane algorithm for minimum perfect 2-matchings

Grötschel, Martin

January 1987

A cutting plane algorithm for minimum perfect 2-matchings / by M. Grötschel, O. Holland. - In: Compu...

The Cutting Plane Method is Polynomial for Perfect Matchings ∗

Karthekeyan Ch

August 2016

The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...

Design and Verify — A New Scheme for Generating Cutting-Planes —

Santanu S. Dey, et al.

January 2010

A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-bo...