default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBonn Workshop of Combinatorial Optimization 2008: Bonn, Germany
- William J. Cook, László Lovász, Jens Vygen:
Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, ISBN 978-3-540-76795-4 - Mourad Baïou, Francisco Barahona:
On the Location and p-Median Polytopes. 1-31 - Sylvia C. Boyd, William R. Pulleyblank:
Facet Generating Techniques. 33-55 - Vasek Chvátal:
Antimatroids, Betweenness, Convexity. 57-64 - Jack Edmonds:
Euler Complexes. 65-68 - Jean Fonlupt, Alexandre Skoda:
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid. 69-85 - András Frank, Tamás Király:
A Survey on Covering Supermodular Functions. 87-126 - Satoru Fujishige
:
Theory of Principal Partitions Revisited. 127-162 - Frank Göring, Jochen Harant:
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. 163-183 - Stefan Hougardy:
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems. 185-200 - T. C. Hu, Leo Landa, Man-tak Shing:
The Unbounded Knapsack Problem. 201-217 - Kazuo Murota:
Recent Developments in Discrete Convex Analysis. 219-260 - Guyslain Naves, András Sebö:
Multiflow Feasibility: An Annotated Tableau. 261-283 - Jaroslav Nesetril:
Many Facets of Dualities. 285-302 - Michael D. Plummer:
On the Structure of Graphs Vertex Critical with Respect to Connected Domination. 303-315 - Yves Pochet, Mathieu Van Vyve:
LS-LIB: A Library of Tools for Solving Production Planning Problems. 317-346 - Lionel Pournin, Thomas M. Liebling:
From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis. 347-363 - Myriam Preissmann, András Sebö:
Graphic Submodular Function Minimization: A Graphic Approach and Applications. 365-385 - András Recski:
Matroids - the Engineers' Revenge. 387-398 - Andreas S. Schulz:
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming. 399-428 - F. Bruce Shepherd:
Single-Sink Multicommodity Flow with Side Constraints. 429-450 - Martin Skutella:
An Introduction to Network Flows over Time. 451-482 - Zoltán Szigeti:
Edge-Connectivity Augmentations of Graphs and Hypergraphs. 483-521 - Dominic Welsh:
Some Problems on Approximate Counting in Graphs and Matroids. 523-544
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
