Search results for "4-polytope"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
86	David Avis, Hiroshi Imai, Tsuyoshi Ito	Generating facets for the cut polytope of a graph by triangular elimination.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 90C57, 05C99
76	Matthias Beck, Dennis Pixton	The Ehrhart Polynomial of the Birkhoff Polytope.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
73	Bernd Gärtner, Martin Jaggi	Coresets for polytope distance.	SCG	2009	DBLP DOI BibTeX RDF	polytope distance, support vector machines, approximation algorithms, kernel methods, sparsity, geometric optimization, coresets
73	Julie Christophe, Jean-Paul Doignon, Samuel Fiorini	The Biorder Polytope.	Order	2004	DBLP DOI BibTeX RDF	biorder, stability-critical graph, polytope, polyhedral combinatorics
73	Jean Fonlupt, Ali Ridha Mahjoub	Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.	IPCO	1999	DBLP DOI BibTeX RDF	2-edge connected graph, critical extreme point, Polytope, cut
71	Petra Mutzel	A Polyhedral Approach to Planar Augmentation and Related Problems.	ESA	1995	DBLP DOI BibTeX RDF
69	Alessandro Marongiu, Paolo Palazzari	Automatic Mapping of System of N-Dimensional Affine Precurrence Equations (SARE) onto Distributed Memory Parallel Systems.	IEEE Trans. Software Eng.	2000	DBLP DOI BibTeX RDF	polytope model, n-dimensional projection, SARE, Automatic parallelization, affine functions
66	Christoph Fünfzig, Dominique Michelucci, Sebti Foufou	Polytope-based computation of polynomial ranges.	SAC	2010	DBLP DOI BibTeX RDF	polynomial ranges, polytopes, multivariate polynomials, Bernstein polynomials
66	Elías F. Combarro, Pedro Miranda 0002	The Polytope of Fuzzy Measures and Its Adjacency Graph.	MDAI	2008	DBLP DOI BibTeX RDF	combinatorial polytopes, diameter, Fuzzy measures, monotone boolean functions
66	Nils Ellmenreich, Christian Lengauer, Martin Griebl	Application of the Polytope Model to Functional Programs.	LCPC	1999	DBLP DOI BibTeX RDF
66	Christian Lengauer	Loop Parallelization in the Polytope Model.	CONCUR	1993	DBLP DOI BibTeX RDF
63	Tom Diethe, Zakria Hussain	Kernel Polytope Faces Pursuit.	ECML/PKDD (1)	2009	DBLP DOI BibTeX RDF	Polytope Faces Pursuit, Orthogonal Matching Pursuit, Pseudo-dimension, Sample Compression Bounds, Regression, Kernel methods
63	Claire Mathieu, Alistair Sinclair	Sherali-adams relaxations of the matching polytope.	STOC	2009	DBLP DOI BibTeX RDF	0-1 programming, matching polytope, maximum matching, linear programming relaxation, integrality gap, lift-and-project
63	Yevgeny Schreiber, Micha Sharir	An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map
63	Hervé Fournier, Antoine Vigneron	A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.	Algorithmica	2007	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
63	Yevgeny Schreiber, Micha Sharir	An optimal-time algorithm for shortest paths on a convex polytope in three dimensions.	SCG	2006	DBLP DOI BibTeX RDF	continuous Dijkstra, polytope surface, shortest path, unfolding, geodesics, wavefront, shortest path map
61	Monia Giandomenico, Adam N. Letchford	Exploring the Relationship Between Max-Cut and Stable Set Relaxations.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stable set problem, Polyhedral combinatorics, Max-cut problem
58	Hervé Fournier, Antoine Vigneron	Lower Bounds for Geometric Diameter Problems.	LATIN	2006	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
56	Antonio Frangioni, Andrea Lodi 0001, Giovanni Rinaldi	New approaches for optimizing over the semimetric polytope.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 20E28, 20G40, 20C20
56	Marcus Oswald, Gerhard Reinelt	Constructing New Facets of the Consecutive Ones Polytope.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
56	Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato	On the Skeleton of the Metric Polytope.	JCDCG	2000	DBLP DOI BibTeX RDF
56	Michel X. Goemans, Leslie A. Hall	The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown.	IPCO	1996	DBLP DOI BibTeX RDF
56	Rudolf Müller, Andreas S. Schulz	The Interval Order Polytope of a Digraph.	IPCO	1995	DBLP DOI BibTeX RDF
53	Eric J. Friedman	Finding a Simple Polytope from Its Graph in Polynomial Time.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Graph, Polynomial time, Polytope
53	Yulai Xie, Jack Snoeyink, Jinhui Xu 0001	Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope.	SCG	2006	DBLP DOI BibTeX RDF	chebyshev center, maximum inscribed sphere, approximation, polytope, core-set
51	Katta G. Murty	A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Convex polytopes and their dual polytopes, FCFs (facetal constraint functions), Enumeration of extreme points, Mukkas, Mukkadvayams, Central problem and strategy for its solution, Nearest points, Linear and convex quadratic programs, Segments, Adjacency
51	Makoto Miwa, Tadashi Wadayama, Ichi Takumi	A cutting-plane method based on redundant rows for improving fractional distance.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
51	Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi	A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.	LATIN	2008	DBLP DOI BibTeX RDF
51	Alessandro Marongiu, Paolo Palazzari	A New Memory-Saving Technique to Map System of Affine Recurrence Equations (SARE) onto Distributed Memory Systems.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
51	H. S. M. Coxeter	Seven Cubes and Ten 24-Cells.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
51	Joe D. Warren	Barycentric coordinates for convex polytopes.	Adv. Comput. Math.	1996	DBLP DOI BibTeX RDF
51	Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang	Convexity-based algorithms for design centering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
50	Ulrich Kortenkamp	Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
48	Bernard Chazelle, Wolfgang Mulzer	Computing hereditary convex structures.	SCG	2009	DBLP DOI BibTeX RDF	half-space range searching, hereditary convex hulls, convex polytope
48	Martin Griebl, Paul Feautrier, Christian Lengauer	On Index Set Splitting.	IEEE PACT	1999	DBLP DOI BibTeX RDF	index set splitting, polytope model, Automatic parallelization, loop parallelization
45	Meinolf Sellmann	The Polytope of Tree-Structured Binary Constraint Satisfaction Problems.	CPAIOR	2008	DBLP DOI BibTeX RDF
45	Jean Fonlupt, Ali Ridha Mahjoub	Critical extreme points of the 2-edge connected spanning subgraph polytope.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90B10, 90C27, 90C57
45	Eduardo N. Gonçalves, Reinaldo M. Palhares, Ricardo H. C. Takahashi	H2/Hinfinity filter design for systems with polytope-bounded uncertainty.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
45	Roman N. Karasev	Partitions of a Polytope and Mappings of a Point Set to Facets.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
45	Raghav Kulkarni, Meena Mahajan	Seeking a Vertex of the Planar Matching Polytope in NC.	ESA	2004	DBLP DOI BibTeX RDF
45	Andreas Eisenblätter	The Semidefinite Relaxation of the k -Partition Polytope Is Strong.	IPCO	2002	DBLP DOI BibTeX RDF
45	Tamás Fleiner	A Matroid Generalization of the Stable Matching Polytope.	IPCO	2001	DBLP DOI BibTeX RDF
45	Volker Kaibel	Reconstructing a Simple Polytope from Its Graph.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
45	Michael McKenna, Raimund Seidel	Finding the optimal shadows of a convex polytope.	SCG	1985	DBLP DOI BibTeX RDF
43	Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann	The Polytope of Context-Free Grammar Constraints.	CPAIOR	2009	DBLP DOI BibTeX RDF	grammar constraints, polytope
43	Gerald Lach, Marco E. Lübbecke	Optimal University Course Timetables and the Partial Transversal Polytope.	WEA	2008	DBLP DOI BibTeX RDF	partial transversal polytope, university course timetabling, integer programming
43	David Orden, Francisco Santos	The polytope of non-crossing graphs on a planar point set.	ISSAC	2004	DBLP DOI BibTeX RDF	non-crossing graphs, polytope
43	Jean B. Lasserre, Eduardo S. Zeron	A Laplace transform algorithm for the volume of a convex polytope.	J. ACM	2001	DBLP DOI BibTeX RDF	volume of a convex polytope, Computational geometry, Laplace transform, convex polytopes
41	Tamás Éltetö, Péter Vaderna	Finding upper-triangular representations for phase-type distributions with 3 distinct real poles.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Triangular order, Phase-type distribution, Minimal representation
41	Christoph Buchheim, Frauke Liers, Marcus Oswald	A Basic Toolbox for Constrained Quadratic 0/1 Optimization.	WEA	2008	DBLP DOI BibTeX RDF	maximum cut problem, local cuts, similar subgraphs, quadratic programming, crossing minimization
41	Luc C. G. J. M. Habets, Jan H. van Schuppen	Control of Piecewise-Linear Hybrid Systems on Simplices and Rectangles.	HSCC	2001	DBLP DOI BibTeX RDF	Piecewise-linear hybrid systems, polyhedral set, multi-dimensional rectangle, reachability, facet, simplex, control law
41	Harald Günzel	On the Universal Partition Theorem for 4-Polytopes.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
41	Petra Mutzel, René Weiskircher	Two-Layer Planarization in Graph Drawing.	ISAAC	1998	DBLP DOI BibTeX RDF
38	Christos A. Athanasiadis	On the Graph Connectivity of Skeleta of Convex Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Balinski’s theorem, Incidence graph, Skeleton, Convex polytope, Cell complex, Vertex connectivity
38	S. J. Gismondi, E. R. Swart	A model of the coNP-complete non-Hamilton tour decision problem for directed graphs.	Math. Program.	2004	DBLP DOI BibTeX RDF	Extended formulation, Assignment polytope, coNP, Projection, Hamiltonicity
38	Christian Icking, Lihong Ma 0001	A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.	STOC	2001	DBLP DOI BibTeX RDF	convex distance function, complexity, Voronoi diagram, polyhedron, convex polytope, bisector, lower envelope
38	Marek Teichmann, Bud Mishra	Probabilistic Algorithms for Efficient Grasping and Fixturing.	Algorithmica	2000	DBLP DOI BibTeX RDF	Multifinger robot hands, Closure grasps, Grasp metrics, Polytope covering, Approximate geometric algorithms, Grasping, Fixturing
38	Graham M. Megson, Xian Chen	A synthesis method of LSGP partitioning for given-shape regular arrays.	IPPS	1995	DBLP DOI BibTeX RDF	LSGP partitioning, given-shape regular arrays, computational polytope, activity matrix, timing vector, locally sequential globally parallel, parallel algorithms, data structures, systolic arrays, processor arrays
35	Tomás Werner	Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	Weighted constraint satisfaction, marginal polytope, cut polytope, tree-reweighted max-product, Markov random field, graphical model, global constraint, linear programming relaxation, Gibbs distribution, cutting-plane algorithm, supermodularity
35	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating all vertices of a polyhedron is hard.	SODA	2006	DBLP DOI BibTeX RDF	enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities
35	Hongwei Liu 0001, Sanyang Liu, Fengmin Xu	A Tight Semidefinite Relaxation of the MAX CUT Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem
35	Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura	The stable set polytope of quasi-line graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57, 90C10
35	Alexander I. Barvinok, Isabella Novik	A Centrally Symmetric Version of the Cyclic Polytope.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
35	Anna Galluccio, Claudio Gentile, Paolo Ventura	On the Stable Set Polytope of Claw-Free Graphs.	COCOA	2008	DBLP DOI BibTeX RDF
35	Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis	On the graphical relaxation of the symmetric traveling salesman polytope.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 52B55, 90C27
35	Eric J. Friedman	Finding a Polytope from Its Graph in Polynomial Time.	IPCO	2007	DBLP DOI BibTeX RDF
35	Mark D. Plumbley	Recovery of Sparse Representations by Polytope Faces Pursuit.	ICA	2006	DBLP DOI BibTeX RDF
35	Egon Balas, Rüdiger Stephan	On the Cycle Polytope of a Directed Graph and Its Relaxations.	OR	2006	DBLP DOI BibTeX RDF
35	Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura	Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.	IPCO	2005	DBLP DOI BibTeX RDF
35	Alper Atamtürk, Juan Carlos Muñoz	A study of the lot-sizing polytope.	Math. Program.	2004	DBLP DOI BibTeX RDF
35	Richard P. Stanley, Jim Pitman	A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
35	László Lipták, László Lovász 0001	Critical Facets of the Stable Set Polytope.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C69, 90C57
35	Anders Björner, Svante Linusson	The Number of k -Faces of a Simple d -Polytope.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
35	Sariel Har-Peled	Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
35	Joseph O'Rourke, Catherine A. Schevon	Computing the Geodesic Diameter of a 3-Polytope.	SCG	1989	DBLP DOI BibTeX RDF
33	Laleh Haerian Ardekani, Tiru S. Arthanari	Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration.	MCO	2008	DBLP DOI BibTeX RDF	Pedigree polytope, Multistage insertion formulation, Membership problem, Combinatorial optimization, Traveling salesman problem
30	Khaled M. Elbassioni, Hans Raj Tiwary	Complexity of Approximating the Vertex Centroid of a Polyhedron.	ISAAC	2009	DBLP DOI BibTeX RDF
30	Efim D. Gluskin, Alexander E. Litvak	Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index
30	Arndt von Schemde, Bernhard von Stengel	Strategic Characterization of the Index of an Equilibrium.	SAGT	2008	DBLP DOI BibTeX RDF
30	Markus Chimani, Petra Mutzel, Immanuel M. Bomze	A New Approach to Exact Crossing Minimization.	ESA	2008	DBLP DOI BibTeX RDF
30	Hans Raj Tiwary, Khaled M. Elbassioni	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.	SCG	2008	DBLP DOI BibTeX RDF	vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality
30	John Little, Ryan Schwarz	On toric codes and multivariate Vandermonde matrices.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) Primary 94B27, Secondary 52B20, 14M25
30	Jonathan A. Kelner, Daniel A. Spielman	A randomized polynomial-time simplex algorithm for linear programming.	STOC	2006	DBLP DOI BibTeX RDF
30	Dinani Gomes, Manuel Fernández Delgado, Senén Barro	Internal Categories with Irregular Geometry and Overlapping in ART Networks.	CAEPIA	2005	DBLP DOI BibTeX RDF
30	Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor	Experiences with Enumeration of Integer Projections of Parametric Polytopes.	CC	2005	DBLP DOI BibTeX RDF
30	Gyula Pap	A TDI Description of Restricted 2-Matching Polytopes.	IPCO	2004	DBLP DOI BibTeX RDF
30	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 52B05, 90C27, 68Q17, 90C57, 90C10, 90C60
30	Roger Z. Ríos-Mercado, Jonathan F. Bard	The Flow Shop Scheduling Polyhedron with Setup Time.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	facet-defining inequalities, polyhedral combinatorics, setup times, flow shop scheduling, asymmetric traveling salesman problem, linear ordering problem
30	Johan P. Hansen	Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes.	Appl. Algebra Eng. Commun. Comput.	2002	DBLP DOI BibTeX RDF
30	Christian Haase 0001, Günter M. Ziegler	Examples and Counterexamples for the Perles Conjecture.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
30	Emo Welzl	Entering and Leaving j-Facets.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
30	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	IPCO	1999	DBLP DOI BibTeX RDF
30	Artur Andrzejak 0001, Komei Fukuda	Optimization over k-set Polytopes and Efficient k-set Enumeration.	WADS	1999	DBLP DOI BibTeX RDF
30	Eric K. Babson, Louis J. Billera	The Geometry of Products of Minors.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
30	Kent Cantwell	Edge-Ramsey Theory.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
30	Philippe Clauss, Vincent Loechner	Parametric Analysis of Polyhedral Iteration Spaces.	ASAP	1996	DBLP DOI BibTeX RDF	parametric vertices, parametric counting, Ehrhart polynomials, automatic parallelization, nested loops, convex polyhedra
30	Mark Velednitsky	Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem.	CoRR	2018	DBLP BibTeX RDF
30	Mark Velednitsky	Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem.	Oper. Res. Lett.	2017	DBLP DOI BibTeX RDF
30	Romeo Orsolino, Michele Focchi, Carlos Mastalli, Hongkai Dai, Darwin G. Caldwell, Claudio Semini	The Actuation-consistent Wrench Polytope (AWP) and the Feasible Wrench Polytope (FWP).	CoRR	2017	DBLP BibTeX RDF
30	Takayuki Hibi, Nan Li, Yoshimi Sahara, Akihiro Shikama	The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set.	Discret. Math.	2017	DBLP DOI BibTeX RDF