The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase 4-polytope (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1972-1978 (15) 1979-1985 (22) 1986-1989 (31) 1990-1991 (22) 1992 (21) 1993 (15) 1994 (16) 1995 (22) 1996 (25) 1997 (21) 1998 (23) 1999 (30) 2000 (26) 2001 (35) 2002 (28) 2003 (41) 2004 (45) 2005 (43) 2006 (59) 2007 (51) 2008 (74) 2009 (57) 2010 (24) 2011 (37) 2012 (22) 2013 (23) 2014 (39) 2015 (26) 2016 (40) 2017 (36) 2018 (51) 2019 (40) 2020 (44) 2021 (41) 2022 (42) 2023 (37) 2024 (5)
Publication types (Num. hits)
article(855) incollection(6) inproceedings(364) phdthesis(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 419 occurrences of 276 keywords

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