Tepper - PDFSEARCH.IO - Document Search Engine

Tepper
Results: 375

#	Item
311	Mathematical Programming manuscript No. (will be inserted by the editor) Improved strategies for branching on general disjunctions G. Cornu´ejols · L. Liberti · G. Nannicini Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2008-07-21 10:04:56 Combinatorial optimization Algebraic combinatorics Representation theory Glycoproteins Immune system Immunoglobulin D Restricted representation Linear programming relaxation Branch and bound Mathematics Mathematical optimization Theoretical computer science
312	Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2000-09-19 18:20:11 Line graph Clique Perfect graph Bipartite graph Matching NP-complete problems Combinatorial optimization Tree decomposition Graph structure theorem Graph theory Graph operations Chordal graph
313	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 Operator theory Projection Proj construction Convex hull Mathematics Mathematical analysis Functional analysis
314	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 Graph coloring Planar graphs Edge coloring Sperner family Matroid Bipartite graph Petersen graph Cubic graph Minor Graph theory Mathematics Matroid theory
315	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 Combinatorial optimization Operations research Relaxation Convex optimization Linear programming relaxation Linear programming Cutting-plane method Graph Matching Mathematical optimization Mathematics Graph theory
316	Cutting Planes from Two-Term Disjunctions Pierre Bonami LIF, Facult´e de Sciences de Luminy, Universit´e de Marseille, France [removed] Michele Conforti Dipartamento di Matematica Pura e Applicata, Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2013-05-28 08:54:53 U0 Linear complementarity problem Vector space Convex hull Algebra Mathematics Linear algebra
317	This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2010-04-05 10:07:13 Operations research Elementary algebra Cutting-plane method Linear programming Convex function Inequality Ample line bundle Polyhedron Exponentiation Mathematical optimization Mathematics Mathematical analysis
318	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 Applied mathematics Cutting-plane method Simplex algorithm Linear programming Function Algorithm Mathematical optimization Mathematics Operations research
319	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 Operations research Convex optimization Linear programming Combinatorial optimization Relaxation Approximation algorithm Cutting-plane method Optimization problem Nonlinear programming Mathematical optimization Mathematics Applied mathematics
320	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 Graph theory Operations research Theoretical computer science Backtracking Pattern matching Binary tree B-tree Algorithm Branch and bound Mathematics Search algorithms Applied mathematics

UPDATE