Search results for "Cutting planes"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen	Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems.	FOCS	1998	DBLP DOI BibTeX RDF	Cutting Planes proof, tree-like proof, regular resolution, Davis-Putnam resolution, monotone real circuit, real communication complexity, lower bounds, resolution, propositional proof complexity
2	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	CiE	2009	DBLP DOI BibTeX RDF
2	Sanjeeb Dash, Oktay Günlük	On the strength of Gomory mixed-integer cuts as group cuts.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mixed integer rounding, Cyclic group polyhedra, Integer programming, Cutting planes
2	Victor F. Cavalcante, Cid C. de Souza	Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
2	Igor Dukanovic, Franz Rendl	Semidefinite programming relaxations for graph coloring and maximal clique problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Lovász theta number, Clique number, Cutting planes, Chromatic number
2	Alain Faye, Frédéric Roupin	A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.	ESA	2005	DBLP DOI BibTeX RDF
2	Vasco M. Manquinho, João P. Marques Silva	On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.	SAT	2005	DBLP DOI BibTeX RDF
2	Ralph E. Gomory, Ellis L. Johnson	T-space and cutting planes.	Math. Program.	2003	DBLP DOI BibTeX RDF
2	Ralph E. Gomory, Ellis L. Johnson, Lisa Evans	Corner Polyhedra and their connection with cutting planes.	Math. Program.	2003	DBLP DOI BibTeX RDF
2	Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi	Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.	FOCS	2003	DBLP DOI BibTeX RDF
2	Filippo Focacci, Andrea Lodi, Michela Milano	Cutting Planes in Constraint Programming: A Hybrid Approach.	CP	2000	DBLP DOI BibTeX RDF
2	Yanlin Guan, Robert J. Moorhead	Compression of Arbitrary Cutting Planes.	Data Compression Conference	1999	DBLP DOI BibTeX RDF
1	Alexander Engau, Miguel F. Anjos, Anthony Vannelli	On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.	Optimization Methods and Software	2012	DBLP DOI BibTeX RDF
1	James Cussens	Bayesian network learning with cutting planes	CoRR	2012	DBLP BibTeX RDF
1	Yogesh P. Awate	Improved theoretical guarantees regarding a class of two-row cutting planes	CoRR	2012	DBLP BibTeX RDF
1	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk	Cutting planes for branch-and-price algorithms.	Networks	2011	DBLP DOI BibTeX RDF
1	Amitabh Basu, Robert Hildebrand, Matthias Köppe	Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets	CoRR	2011	DBLP BibTeX RDF
1	Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno	A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.	INOC	2011	DBLP DOI BibTeX RDF
1	Santanu S. Dey, Sebastian Pokutta	Design and Verify: A New Scheme for Generating Cutting-Planes.	IPCO	2011	DBLP DOI BibTeX RDF
1	Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau	On Counting Lattice Points and Chvátal-Gomory Cutting Planes.	CPAIOR	2011	DBLP DOI BibTeX RDF
1	James Cussens	Bayesian network learning with cutting planes.	UAI	2011	DBLP BibTeX RDF
1	Sarah Drewes, Sebastian Pokutta	Cutting-planes for weakly-coupled 0/1 second order cone programs.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland	A strengthened formulation and cutting planes for the open pit mine production scheduling problem.	Computers & OR	2010	DBLP DOI BibTeX RDF
1	Omid Amini, Jean-Daniel Boissonnat, Pooran Memari	Geometric tomography with topological guarantees.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	homotopy theory, reconstruction from cross sections, thopological guarantees
1	Paul Beame, Trinh Huynh, Toniann Pitassi	Hardness amplification in proof complexity.	STOC	2010	DBLP DOI BibTeX RDF	communication complexity, proof complexity
1	Santanu S. Dey, Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller	On the extreme inequalities of infinite group problems.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C57
1	Philipp M. Christophel	Separation algorithms for cutting planes based on mixed integer row relaxations: implementation and evaluation in the context of mixed integer programming solver software.		2009	RDF
1	Philipp M. Christophel	Separation algorithms for cutting planes based on mixed integer row relaxations.		2009	RDF
1	Antonio Frangioni, Claudio Gentile	A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.	Oper. Res. Lett.	2009	DBLP DOI BibTeX RDF
1	Pasquale Avella, Maurizio Boccia, Igor Vasil'ev	Computational experience with general cutting planes for the Set Covering problem.	Oper. Res. Lett.	2009	DBLP DOI BibTeX RDF
1	Kent Andersen, Christian Wagner, Robert Weismantel	On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows.	SIAM Journal on Optimization	2009	DBLP DOI BibTeX RDF
1	Yongpei Guan, Shabbir Ahmed, George L. Nemhauser	Cutting Planes for Multistage Stochastic Integer Programs.	Operations Research	2009	DBLP DOI BibTeX RDF
1	Julia L. Higle, Suvrajeet Sen	Stochastic Linear Programming: Decomposition and Cutting Planes.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Stochastic programming, Cutting plane algorithm
1	Mike Bailey	Using GPU Shaders for Visualization.	IEEE Computer Graphics and Applications	2009	DBLP DOI BibTeX RDF	computer graphics software, OpenGL Shading Language, visualization, computer graphics, point clouds, cutting planes, shaders, GPU programming, GLSL
1	Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial	Nondifferentiable Optimization: Cutting Plane Methods.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Cutting planes, Nonsmooth optimization, Nondifferentiable optimization
1	John E. Mitchell	Integer Programming: Cutting Plane Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Integer program, Exact algorithms, Cutting planes
1	John E. Mitchell	Integer Programming: Branch and Cut Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Integer program, Branch and bound, Exact algorithms, Cutting planes
1	Hanif D. Sherali	Disjunctive Programming.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Polyhedral annexation, Facial disjunctive program, Nondominated cuts, Tight relaxations, Model reformulation, Mixed integer 0-1 programs, Convex hull, Cutting planes, Facet, Valid inequalities, Disjunctive programming, Nonconvex programs, Lift-and-project, Reformulation-linearization technique, Polynomial programs
1	Toniann Pitassi, Nathan Segerlind	Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures.	SODA	2009	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.	Algorithmica	2009	DBLP DOI BibTeX RDF	Chvátal-Gomory cuts, Separation algorithms, Integer programming
1	Frédéric Babonneau, Jean-Philippe Vial	ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) Nondifferentiable optimization, Network flow problem
1	Maurizio Boccia, Antonio Sforza, Claudio Sterle, Igor Vasil'ev	A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes.	J. Math. Model. Algorithms	2008	DBLP DOI BibTeX RDF
1	Miguel F. Anjos, Anthony Vannelli	Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.	INFORMS Journal on Computing	2008	DBLP DOI BibTeX RDF
1	Chun-Nam John Yu, Thorsten Joachims	Training structural svms with kernels using sampled cuts.	KDD	2008	DBLP DOI BibTeX RDF	support vector machines, kernels, large-scale problems
1	Nadine Couture, Guillaume Rivière, Patrick Reuter	GeoTUI: a tangible user interface for geoscience.	Tangible and Embedded Interaction	2008	DBLP DOI BibTeX RDF	user study, TUI, tabletop, two-handed interaction, geoscience
1	Asim Wagan, Afzal Godil, Xiaolan Li	SHREC'08 entry: 3D shape searching using object partitioning.	Shape Modeling International	2008	DBLP DOI BibTeX RDF
1	Sovira Tan, Jianhua Yao, Michael M. Ward, Lawrence Yao, Ronald M. Summers	Computer Aided Evaluation of Ankylosing Spondylitis Using High-Resolution CT.	IEEE Trans. Med. Imaging	2008	DBLP DOI BibTeX RDF
1	Daniel G. Espinoza	Computing with Multi-row Gomory Cuts.	IPCO	2008	DBLP DOI BibTeX RDF
1	Trinh Minh Tri Do, Thierry Artières	A Fast Method for Training Linear SVM in the Primal.	ECML/PKDD	2008	DBLP DOI BibTeX RDF
1	M. Zhao, I. R. de Farias	The mixing-MIR set with divisible capacities.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C10, 90C57, 90C11
1	Mohammad Al Hasan, Krishna K. Ramachandran, John E. Mitchell	Optimal placement of stereo sensors.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Sensors, Integer programming, GRASP, Branch-and-cut
1	Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal	The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.	CPAIOR	2007	DBLP DOI BibTeX RDF	integer programming, constraint programming, cutting planes, polyhedral combinatorics
1	Arist Kojevnikov	Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities.	SAT	2007	DBLP DOI BibTeX RDF	integer programming, cutting planes, propositional proof complexity
1	Sylvia C. Boyd, Sally Cockburn, Danielle Vella	On the domino-parity inequalities for the STSP.	Math. Program.	2007	DBLP DOI BibTeX RDF	Branch and cut method, Travelling salesman problem, Cutting planes, Valid inequalities
1	Jean-Daniel Boissonnat, Pooran Memari	Shape reconstruction from unorganized cross-sections.	Symposium on Geometry Processing	2007	DBLP DOI BibTeX RDF
1	Lanbo Zheng, Christoph Buchheim	A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.	COCOA	2007	DBLP DOI BibTeX RDF
1	Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka	Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.	ESA	2007	DBLP DOI BibTeX RDF
1	Sungyeol Lee, Haeyoung Lee	Parameterization of 3D Surface Patches by Straightest Distances.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF
1	Shenglan Liu, Ralph R. Martin, Frank C. Langbein, Paul L. Rosin	Segmenting Periodic Reliefs on Triangle Meshes.	IMA Conference on the Mathematics of Surfaces	2007	DBLP DOI BibTeX RDF
1	Santanu S. Dey, Jean-Philippe P. Richard	Sequential-Merge Facets for Two-Dimensional Group Problems.	IPCO	2007	DBLP DOI BibTeX RDF
1	Quentin Louveaux, Laurence A. Wolsey	Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.	Annals OR	2007	DBLP DOI BibTeX RDF	Mixed integer rounding, Single node flow sets, Lifting
1	Javier Marenco, Annegret Wagler	Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.	Annals OR	2007	DBLP DOI BibTeX RDF	Bandwidth allocation, Polyhedral combinatorics
1	Pasquale Avella, Antonio Sassano, Igor Vasil'ev	Computational study of large-scale p -Median problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C06, 90C27, 90C10, 90C35
1	Vasco M. Manquinho, João P. Marques Silva	On Using Cutting Planes in Pseudo-Boolean Optimization.	JSAT	2006	DBLP BibTeX RDF
1	Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi	Rank Bounds and Integrality Gaps for Cutting Planes Procedures.	Theory of Computing	2006	DBLP DOI BibTeX RDF
1	Sungyeol Lee, Joonhee Han, Haeyoung Lee	Straightest Paths on Meshes by Cutting Planes.	GMP	2006	DBLP DOI BibTeX RDF
1	Edoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli	Optimizing base station location and configuration in UMTS networks.	Annals OR	2006	DBLP DOI BibTeX RDF	Base station configuration, Mixed integer programming models, Tabu search, Network planning, Cutting planes, Location problem
1	Alexander Martin, Markus Möller, Susanne Moritz	Mixed Integer Models for the Stationary Case of Gas Network Optimization.	Math. Program.	2006	DBLP DOI BibTeX RDF	Gas optimization, Piece-wise linear functions, SOS constraints, Branch-and-Bound, Mixed integer programming, Cutting planes
1	Hanif D. Sherali, Jonathan Cole Smith	A polyhedral study of the generalized vertex packing problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Vertex packing, Valid inequalities/cutting planes, Air-space management, Integer programming, Reformulation-linearization technique
1	Vadim A. Slavin, Robert Pelcovits, George Loriot, Andrew Callan-Jones, David H. Laidlaw	Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals.	IEEE Trans. Vis. Comput. Graph.	2006	DBLP DOI BibTeX RDF	Tensor Visualization, Liquid Crystals, Case Studies, Molecular Modeling
1	Gérard Cornuéjols, Claude Lemaréchal	A convex-analysis perspective on disjunctive cuts.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A41, 90C11
1	Sanjeeb Dash, Oktay Günlük	Valid inequalities based on the interpolation procedure.	Math. Program.	2006	DBLP DOI BibTeX RDF
1	Sophie Demassey, Christian Artigues, Philippe Michelon	Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem.	INFORMS Journal on Computing	2005	DBLP DOI BibTeX RDF
1	Jonathan Eckstein, Mikhail Nediak	Depth-Optimized Convexity Cuts.	Annals OR	2005	DBLP DOI BibTeX RDF	convexity cuts, integer programming, cutting planes
1	R. Lougee-Heimer, W. Adams	A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs.	Annals OR	2005	DBLP DOI BibTeX RDF	coefficient adjustment, continuous relaxation, integer programming, cutting planes
1	Manfred Padberg	Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.	Annals OR	2005	DBLP DOI BibTeX RDF	Gomory cuts, mixed-integer programming, branch-and-cut, cutting planes
1	Rodrigo G. Luque, João Luiz Dihl Comba, Carla Maria Dal Sasso Freitas	Broad-phase collision detection using semi-adjusting BSP-trees.	SI3D	2005	DBLP DOI BibTeX RDF	collision detection, dynamic scenes, BSP-trees
1	Vasco M. Manquinho, João P. Marques Silva	Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.	ICTAI	2005	DBLP DOI BibTeX RDF
1	Manfred Weiler, Ralf P. Botchen, Simon Stegmaier, Thomas Ertl, Jingshu Huang, Yun Jang, David S. Ebert, Kelly P. Gaither	Hardware-Assisted Feature Analysis and Visualization of Procedurally Encoded Multifield Volumetric Data.	IEEE Computer Graphics and Applications	2005	DBLP DOI BibTeX RDF	procedural encoding, meshless representation, volume rendering, radial basis functions, RBF, flow visualization, feature detection
1	Edward A. Hirsch, Sergey I. Nikolenko	Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution.	SAT	2005	DBLP DOI BibTeX RDF
1	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
1	Mohit Tawarmalani, Nikolaos V. Sahinidis	A polyhedral branch-and-cut approach to global optimization.	Math. Program.	2005	DBLP DOI BibTeX RDF	Factorable programming, Convexity identification, Mixed-integer nonlinear programming, Convexification, Outer approximation
1	Dieter Vandenbussche, George L. Nemhauser	A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.	Math. Program.	2005	DBLP DOI BibTeX RDF
1	Pasquale Avella, Igor Vasil'ev	A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.	J. Scheduling	2005	DBLP DOI BibTeX RDF
1	Matthias Köppe, Robert Weismantel	Cutting planes from a mixed integer Farkas lemma.	Oper. Res. Lett.	2004	DBLP DOI BibTeX RDF
1	Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo	Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control.	SIAM Journal on Optimization	2004	DBLP DOI BibTeX RDF
1	Marcus Porembski	Cutting Planes for Low-Rank-Like Concave Minimization Problems.	Operations Research	2004	DBLP DOI BibTeX RDF
1	Eva K. Lee	Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment.	INFORMS Journal on Computing	2004	DBLP DOI BibTeX RDF
1	Xavier Tricoche, Christoph Garth, Gordon L. Kindlmann, Eduard Deines, Gerik Scheuermann, Markus Rütten, Charles D. Hansen	Visualization of Intricate Flow Structures for Vortex Breakdown Analysis.	IEEE Visualization	2004	DBLP DOI BibTeX RDF	vortex analysis, parametric topology, volume rendering, flow visualization, cutting planes
1	Júlíus Atlason, Marina A. Epelman, Shane G. Henderson	Call Center Staffing with Simulation and Cutting Plane Methods.	Annals OR	2004	DBLP DOI BibTeX RDF	sample average approximation, call centers, cutting planes, simulation optimization
1	Adam Ouorou	Epsilon-proximal decomposition method.	Math. Program.	2004	DBLP DOI BibTeX RDF	proximal point algorithms, large-scale programming, decomposition, convex optimization, multicommodity flows, cutting planes
1	Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi	Constraint Propagation as a Proof System.	CP	2004	DBLP DOI BibTeX RDF
1	Kenneth L. McMillan	Applications of Craig Interpolation to Model Checking.	CSL	2004	DBLP DOI BibTeX RDF
1	Jinbo Xu, Ming Li, Ying Xu	Protein Threading by Linear Programming: Theoretical Analysis and Computational Results.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	CAFASP, integer program, branch-and-cut, cutting plane, protein threading
1	Jens Lysgaard, Adam N. Letchford, Richard W. Eglese	A new branch-and-cut algorithm for the capacitated vehicle routing problem.	Math. Program.	2004	DBLP DOI BibTeX RDF	separation, vehicle routing, branch-and-cut
1	Albert Atserias, Maria Luisa Bonet, Jordi Levy	On Chvatal Rank and Cutting Planes Proofs	Electronic Colloquium on Computational Complexity (ECCC)	2003	DBLP BibTeX RDF
1	Quentin Louveaux, Laurence A. Wolsey	Lifting, superadditivity, mixed integer rounding and single node flow sets revisited.	4OR	2003	DBLP DOI BibTeX RDF	mixed integer rounding, single node flow sets, Lifting
1	Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey	Cutting planes in integer and mixed integer programming.	Discrete Applied Mathematics	2002	DBLP DOI BibTeX RDF
1	Pablo Rey, Claudia A. Sagastizábal	Convex Normalizations in Lift-and-Project Methods for 0-1 Programming.	Annals OR	2002	DBLP DOI BibTeX RDF	disjunctive cuts, 0-1 integer programming, Branch-and-Cut, cutting planes, Lift-and-Project