Cornu

Results: 113



#Item
91Operator theory / Projection / Proj construction / Convex hull / Mathematics / Mathematical analysis / Functional analysis

Correction to “Intersection Cuts with Infinite Split Rank” Amitabh Basu1 , G´erard Cornu´ejols2,3,4 Fran¸cois Margot2,5 February 2013 Abstract We point out that the statement of Lemma 2.2 (ii) in [1] is incorrect.

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2013-02-26 18:34:03
92Graph coloring / Planar graphs / Edge coloring / Sperner family / Matroid / Bipartite graph / Petersen graph / Cubic graph / Minor / Graph theory / Mathematics / Matroid theory

Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2005-08-27 11:07:38
93Combinatorial optimization / Operations research / Relaxation / Convex optimization / Linear programming relaxation / Linear programming / Cutting-plane method / Graph / Matching / Mathematical optimization / Mathematics / Graph theory

How tight is the corner relaxation? Insights gained from the stable set problem G´erard Cornu´ejolsa,1 , Carla Michinib,2,∗, Giacomo Nannicinic,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh,

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2012-02-13 11:38:14
94Applied mathematics / Cutting-plane method / Simplex algorithm / Linear programming / Function / Algorithm / Mathematical optimization / Mathematics / Operations research

Combining Lift-and-Project and Reduce-and-Split Egon Balas∗ Tepper School of Business, Carnegie Mellon University, PA Email: [removed] G´erard Cornu´ejols† Tepper School of Business, Carnegie Mellon Unive

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2011-07-18 11:30:17
95Operations research / Convex optimization / Linear programming / Combinatorial optimization / Relaxation / Approximation algorithm / Cutting-plane method / Optimization problem / Nonlinear programming / Mathematical optimization / Mathematics / Applied mathematics

An algorithmic framework for convex mixed integer nonlinear programs Pierre Bonami1,5 , Lorenz T. Biegler2 , Andrew R. Conn3 , G´erard Cornu´ejols1,4 , Ignacio E. Grossmann2 , Carl D. Laird2,5 , Jon Lee3 , Andrea Lodi3

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2006-04-16 15:22:42
96Graph theory / Operations research / Theoretical computer science / Backtracking / Pattern matching / Binary tree / B-tree / Algorithm / Branch and bound / Mathematics / Search algorithms / Applied mathematics

Early Estimates of the Size of Branch-and-Bound Trees G´erard Cornu´ejols∗, Miroslav Karamanov†, Yanjun Li‡ 23th April[removed]Abstract

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2004-04-29 18:10:17
970.999... / Rounding / Factorial / Mathematics / Cutting-plane method / Inequality

Elementary Closures for Integer Programs  Gerard Cornuejols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA April[removed]revised October 2000)

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2000-10-30 13:48:20
98Chernoff bound / Probability theory / Stochastic processes

A probabilistic analysis of the strength of the split and triangle closures Amitabh Basu G´erard Cornu´ejols

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2010-10-21 11:36:17
99Stochastic processes / Mathematics / Dimension / Triangle / Triangle geometry / Triangles

A Probabilistic Analysis of the Strength of the Split and Triangle Closures Amitabh Basu1 , G´erard Cornu´ejols2? , and Marco Molinaro2?? 1 University of California, Davis

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2011-02-18 12:55:47
100Mathematics / Applied mathematics / Maths24 / COMPASS/Sample Code / Cutting-plane method / Polyhedron / Linear programming

Multi-Row Cutting Planes Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets G´erard Cornu´ejols

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2010-03-23 07:55:32
UPDATE