Search results for "polytope"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
30	Juliane Dunkel, Andreas S. Schulz	The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope.	Math. Oper. Res.	2013	DBLP DOI BibTeX RDF
30	Tiru S. Arthanari	Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope.	Discret. Optim.	2013	DBLP DOI BibTeX RDF
30	Juliane Dunkel, Andreas S. Schulz	The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope.	OR	2011	DBLP DOI BibTeX RDF
30	Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti	New facets of the STS polytope generated from known facets of the ATS polytope.	Discret. Optim.	2006	DBLP DOI BibTeX RDF
30	Caterina De Simone	The cut polytope and the Boolean quadric polytope.	Discret. Math.	1990	DBLP DOI BibTeX RDF
30	Ali Ridha Mahjoub	I. Résolution d'un problème de régulation de trafic II. Polytope des absorbants d'un graphe à seuil. (I. Resolving a traffic-control problem II. The polytope of the absorbers of a threshold graph).		1981	RDF
28	Gennadiy Averkov, Martin Henk	Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	?ojasiewicz’s inequality, Theorem of Bröcker and Scheiderer, Polynomial, Polytope, Semi-algebraic set
28	Gilbert L. Peterson, Brent T. McBride	The importance of generalizability for anomaly detection.	Knowl. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Clustering, Anomaly detection, Convex polytope, Ellipsoid
28	Virginie Gabrel	Strengthened 0-1 linear formulation for the daily satellite mission planning.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Stable set polytope, Satellite mission planning, Cocomparability graph, Integer programming
28	Ioannis Z. Emiris, Kyriakos Zervoudakis	Successive Linear Programs for Computing All Integral Points in a Minkowski Sum.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	integral points, linear programming, Minkowski sum, polyhedral combinatorics, convex polytope, duality theory
28	Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe	Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations.	CASES	2004	DBLP DOI BibTeX RDF	Barvinok's decomposition, Ehrhart polynomial, parametric polytope, quasi-polynomial, signed unimodular decomposition, polyhedral model, compiler analysis
28	Oswin Aichholzer, Franz Aurenhammer, Peter Braay	Spatial embedding of pseudo-triangulations.	SCG	2003	DBLP DOI BibTeX RDF	constrained regular complexes, polytope representation, three-dimensional embedding, pseudo-triangulations
28	Milind Dawande	A Notion of Cross-Perfect Bipartite Graphs.	COCOON	2001	DBLP DOI BibTeX RDF	integral polytope, bipartite graph, perfect graph
28	Marcus Oswald, Gerhard Reinelt	Polyhedral Aspects of the Consecutive Ones Problem.	COCOON	2000	DBLP DOI BibTeX RDF	consecutive ones, polytope, branch-and-cut
28	Glenn Davis	Computing separating planes for pairs of disjoint polytopes.	SCG	1985	DBLP DOI BibTeX RDF	extreme halfspace, extreme plane, separating plane, convex hull, polytope, projective transformation, hidden surface elimination
25	Maria Flavia Monaco, Marcello Sammarra, Luigi Moccia	Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Basic solutions, Polytopes, Extreme points, Constrained shortest path
25	Gianpaolo Oriolo, Gautier Stauffer	Clique-circulants and the stable set polytope of fuzzy circular interval graphs.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57
25	Ellen Veomett	A Positive Semidefinite Approximation of the Symmetric Traveling Salesman Polytope.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
25	Dinani Gomes Amorim, Manuel Fernández Delgado, Senén Barro Ameneiro	Polytope ARTMAP: Pattern Classification Without Vigilance Based on General Geometry Categories.	IEEE Trans. Neural Networks	2007	DBLP DOI BibTeX RDF
25	Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec	A Randomized Algorithm for Two Servers in Cross Polytope Spaces.	WAOA	2007	DBLP DOI BibTeX RDF
25	Graham R. Brightwell, Jan van den Heuvel, Leen Stougie	A Linear Bound On The Diameter Of The Transportation Polytope.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 90C27, 90C08
25	Gerhard Reinelt, Dirk Oliver Theis	A note on the Undirected Rural Postman Problem polytope.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57, 05c45
25	Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann	A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming.	CPAIOR	2006	DBLP DOI BibTeX RDF	mathematical programming, hybrid methods, Cost-based filtering
25	Bruce E. Ankenman, Russell C. H. Cheng, Susan M. Lewis	A polytope method for estimating factor main effects efficiently.	WSC	2006	DBLP DOI BibTeX RDF
25	Michael Classen, Martin Griebl	Automatic code generation for distributed memory architectures in the polytope model.	IPDPS	2006	DBLP DOI BibTeX RDF
25	Dimitris Gatzouras, Apostolos Giannopoulos, Nikolaos Markoulakis	Lower Bound for the Maximal Number of Facets of a 0/1 Polytope.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
25	David Orden, Francisco Santos	The Polytope of Non-Crossing Graphs on a Planar Point Set.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
25	Gautam Appa, Dimitris Magos, Ioannis Mourtos	The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	Orthogonal Latin Squares, wheel inequality, facet
25	Jean B. Lasserre	The Integer Hull of a Convex Rational Polytope.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
25	Jean B. Lasserre	The Integer Hull of a Convex Rational Polytope.	ICCSA (3)	2003	DBLP DOI BibTeX RDF
25	Pablo E. Coll, Javier Marenco, Isabel Méndez-Díaz, Paula Zabala	Facets of the Graph Coloring Polytope.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	facets of polyhedra, integer programming, graph coloring
25	M. Azaola, Francisco Santos	The Number of Triangulations of the Cyclic Polytope C (n, n-4).	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
25	Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo	On the Face Lattice of the Metric Polytope.	JCDCG	2002	DBLP DOI BibTeX RDF
25	Patrick Healy, Nikola S. Nikolov	Facets of the Directed Acyclic Graph Layering Polytope.	WG	2002	DBLP DOI BibTeX RDF
25	K. Subramani 0001	On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope.	AISC	2002	DBLP DOI BibTeX RDF
25	Jean François Maurras, Viet Hung Nguyen	A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
25	Hidefumi Ohsugi, Takayuki Hibi	A Normal (0, 1)-Polytope None of Whose Regular Triangulations Is Unimodular.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
25	Brian J. d'Auriol	A Geometric Semantics for Program Representation in the Polytope Model.	LCPC	1999	DBLP DOI BibTeX RDF
25	Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan	Approximating shortest paths on a convex polytope in three dimensions.	J. ACM	1997	DBLP DOI BibTeX RDF	approximation algorithms, convex polytopes, Euclidean shortest paths
25	Eddie Cheng 0001, William H. Cunningham	Separation Problems for the Stable Set Polytope.	IPCO	1995	DBLP DOI BibTeX RDF
25	Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon	Star Unfolding of a Polytope with Applications (Extended Abstract).	SWAT	1990	DBLP DOI BibTeX RDF
20	Cristina Vagnoni, Marino Zennaro	The Analysis and the Representation of Balanced Complex Polytopes in 2D.	Found. Comput. Math.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 52B55, 65Y99
20	Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler	Characterizing and bounding the imperfection ratio for some classes of graphs.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57 (90C27)
20	Sanjiv Kapoor, Xiang-Yang Li 0001	Geodesic Spanners on Polyhedral Surfaces.	ISAAC	2009	DBLP DOI BibTeX RDF
20	Fabio Cuzzolin	Complexes of Outer Consonant Approximations.	ECSQARU	2009	DBLP DOI BibTeX RDF
20	Christoph Fünfzig, Dominique Michelucci, Sebti Foufou	Nonlinear systems solver in floating-point arithmetic using LP reduction.	Symposium on Solid and Physical Modeling	2009	DBLP DOI BibTeX RDF	intersection computation, subdivision solver, linear programming, CAD, interval arithmetic, geometric constraints, geometric constraint solving, distance computation
20	Thomas C. Sharkey, H. Edwin Romeijn	Simplex-inspired algorithms for solving a class of convex programming problems.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Convex optimization, Nonlinear programming, Simplex method
20	Michael I. Hartley	An exploration of locally projective polytopes.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 51M20, 52B15
20	Michael Chertkov, Mikhail G. Stepanov	An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
20	Navin Kashyap	A Decomposition Theory for Binary Linear Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
20	Uwe Nagel 0001	Empty Simplices of Polytopes and Graded Betti Numbers.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
20	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
20	Fabio Cuzzolin	On the Credal Structure of Consistent Probabilities.	JELIA	2008	DBLP DOI BibTeX RDF
20	Antoine Deza, Gabriel Indik	A counterexample to the dominating set conjecture.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Dominating set conjecture, Metric polyhedra, Cut polyhedra
20	Mark D. Plumbley	On Polar Polytopes and the Recovery of Sparse Representations.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
20	Nebojsa Gvozdenovic, Monique Laurent	Semidefinite bounds for the stability number of a graph via sums of squares of polynomials.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C69, 90C27, 90C22
20	Anders Nedergaard Jensen	A Non-Regular Grobner Fan.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
20	Christophe Hohlweg, Carsten E. M. C. Lange	Realizations of the Associahedron and Cyclohedron.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
20	Shmuel Onn, Uriel G. Rothblum	The use of edge-directions and linear programming to enumerate vertices.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Edge-directions, Linear programming, Vertices, Polytopes
20	David Hartvigsen, Yanjun Li	Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).	IPCO	2007	DBLP DOI BibTeX RDF
20	Abhishek Kashyap, Sudipta Sengupta, Randeep Bhatia, Murali S. Kodialam	Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic.	SIGMETRICS	2007	DBLP DOI BibTeX RDF	two-phase routing, variable traffic, scheduling, wireless mesh networks, power control
20	Ivan Villaverde, Manuel Graña, J. L. Jimenez-Bascones	Lattice Independence and Vision Based Mobile Robot Navigation.	KES (2)	2007	DBLP DOI BibTeX RDF	Lattice, Machine Vision, Robot Navigation, Morphological Neural Networks
20	Yongpei Guan, Shabbir Ahmed 0001, George L. Nemhauser, Andrew J. Miller	A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stochastic Lot-Sizing, Multi-stage Stochastic Integer Programming, Polyhedral Study, Branch-and-Cut
20	Martin J. Wainwright, Michael I. Jordan	Log-determinant relaxation for approximate inference in discrete Markov random fields.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
20	David L. Donoho	High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
20	Peter Huggins	iB4e: A Software Framework for Parametrizing Specialized LP Problems.	ICMS	2006	DBLP DOI BibTeX RDF
20	Giancarlo Ferrari-Trecate, Magnus Egerstedt, Annalisa Buffa, Meng Ji	Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control.	HSCC	2006	DBLP DOI BibTeX RDF
20	Huijun Gao, James Lam, Lihua Xie, Changhong Wang	New approach to mixed H2/Hinfinity filtering for polytopic discrete-time systems.	IEEE Trans. Signal Process.	2005	DBLP DOI BibTeX RDF
20	Pasquale Avella, Igor Vasil'ev	A Computational Study of a Cutting Plane Algorithm for University Course Timetabling.	J. Sched.	2005	DBLP DOI BibTeX RDF
20	Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz	Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
20	Nebojsa Gvozdenovic, Monique Laurent	Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.	IPCO	2005	DBLP DOI BibTeX RDF
20	Mark de Berg, Herman J. Haverkort, Micha Streppel	Efficient c-Oriented Range Searching with DOP-Trees.	ESA	2005	DBLP DOI BibTeX RDF
20	Todd P. Coleman, Muriel Médard, Michelle Effros	Towards Practical Minimum-Entropy Universal Decoding.	DCC	2005	DBLP DOI BibTeX RDF
20	Pradeep Varakantham, Rajiv T. Maheswaran, Milind Tambe	Implementation Techniques for Solving POMDPs in Personal Assistant Agents.	PROMAS	2005	DBLP DOI BibTeX RDF
20	Jonathan Richard Shewchuk	Stabbing Delaunay Tetrahedralizations.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF	Delaunay tetrahedralization, Delaunay triangulation
20	Jesús A. De Loera, Shmuel Onn	All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.	IPCO	2004	DBLP DOI BibTeX RDF
20	Nicholas Eriksson	Toric ideals of homogeneous phylogenetic models.	ISSAC	2004	DBLP DOI BibTeX RDF	Gröbner bases, parametric inference, phylogenetic invariants, toric ideals
20	Helena A. Jorge	Combinatorics of Polytopes with a Group of Linear Symmetries of Prime Power Order.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
20	R. J. Gardner, Peyman Milanfar	Reconstruction of Convex Bodies from Brightness Functions.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
20	Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie	Random walks on the vertices of transportation polytopes with constant number of sources.	SODA	2003	DBLP BibTeX RDF
20	Vinicius Foletto Montagner, Pedro Luis Dias Peres	Robust pole location for a DC-DC converter through parameter dependent control.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
20	John McDonald 0004	Fractional Power Series Solutions for Systems of Equations.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
20	Roman N. Karasev	On a Conjecture of A. Bezdek.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
20	Margaret M. Bayer, A. M. Bruening, J. D. Stewart	A Combinatorial Study of Multiplexes and Ordinary Polytopes.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
20	Gil Zussman, Adrian Segall	Capacity Assignment in Bluetooth Scatternets - Analysis and Algorithms.	NETWORKING	2002	DBLP DOI BibTeX RDF	Scheduling, Bluetooth, Personal Area Networks (PAN), Scatternet, Capacity allocation, Capacity assignment
20	Rubén Medina, Andreas Wahle, Mark E. Olszewski, Milan Sonka	Volumetric quantification of coronary arteries reconstructed by fusion between intravascular ultrasound and biplane angiography.	ISBI	2002	DBLP DOI BibTeX RDF
20	C. Richter	Simple Paradoxical Replications of Sets.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
20	Reinhardt Euler	Hajós' Construction and Polytopes.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
20	David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook	TSP Cuts Which Do Not Conform to the Template Paradigm.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
20	Bernard Chazelle, Ding Liu	Lower bounds for intersection searching and fractional cascading in higher dimension.	STOC	2001	DBLP DOI BibTeX RDF
20	Dusan M. Stipanovic, Dragoslav D. Siljak	Jacobi and Gauss-Seidel Iterations for Polytopic Systems: Convergence via Convex M-Matrices.	Reliab. Comput.	2000	DBLP DOI BibTeX RDF
20	Arthur D. Chtcherba, Deepak Kapur	Conditions for exact resultants using the Dixon formulation.	ISSAC	2000	DBLP DOI BibTeX RDF
20	Michael I. Hartley	All Polytopes Are Quotients, and Isomorphic Polytopes Are Quotients by Conjugate Subgroups.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
20	C. Bauer	Infinitesimal Rigidity of Convex Polytopes.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
20	A. A'Campo-Neuen	On Generalized h -Vectors of Rational Polytopes with a Symmetry of Prime Order.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
20	David Bremner	Incremental Convex Hull Algorithms Are Not Output Sensitive.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
20	James T. Klosowski, Martin Held, Joseph S. B. Mitchell, Henry Sowizral, Karel Zikan	Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs.	IEEE Trans. Vis. Comput. Graph.	1998	DBLP DOI BibTeX RDF	discrete orientation polytopes, virtual reality, virtual environments, Collision detection, bounding volume hierarchies, bounding boxes, intersection searching
20	Philippe Clauss, Vincent Loechner	Parametric Analysis of Polyhedral Iteration Spaces.	J. VLSI Signal Process.	1998	DBLP DOI BibTeX RDF
20	David Bremner, Komei Fukuda, Ambros Marzetta	Primal - Dual Methods for Vertex and Facet Enumeration.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
20	Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler	Extremal Properties of 0/1-Polytopes.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF