Matches in SemOpenAlex for { <https://semopenalex.org/work/W1488120084> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W1488120084 abstract "Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem.- Strongly Polynomial Algorithms for the Unsplittable Flow Problem.- Edge Covers of Setpairs and the Iterative Rounding Method.- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates.- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.- On the Rank of Mixed 0,1 Polyhedra.- Fast 2-Variable Integer Programming.- Approximating k-Spanner Problems for k > 2.- A Matroid Generalization of the Stable Matching Polytope.- A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.- Combined Connectivity Augmentation and Orientation Problems.- An Extension of a Theorem of Henneberg and Laman.- Bisubmodular Function Minimization.- On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem.- Circuit Mengerian Directed Graphs.- Integral Polyhedra Related to Even Cycle and Even Cut Matroids.- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.- Synthesis of 2-Commodity Flow Networks.- Bounds for Deterministic Periodic Routing sequences.- Cutting Planes for Mixed 0-1 Semidefinite Programs.- Independence Free Graphs and Vertex connectivity Augmentation.- The Throughput of Sequential Testing.- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.- Pruning by Isomorphism in Branch-and-Cut.- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.- Fences Are Futile: On Relaxations for the Linear Ordering Problem.- Generating Cuts from Multiple-Term Disjunctions.- A (2+?)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.- Performance Guarantees of Local Search for Multiprocessor Scheduling.- connected Joins in Graphs.- Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.- Approximation Algorithms for the Minimum Bends Traveling Salesman Problem." @default.
- W1488120084 created "2016-06-24" @default.
- W1488120084 creator A5017120383 @default.
- W1488120084 creator A5023942331 @default.
- W1488120084 date "2001-06-27" @default.
- W1488120084 modified "2023-09-27" @default.
- W1488120084 title "Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings" @default.
- W1488120084 hasPublicationYear "2001" @default.
- W1488120084 type Work @default.
- W1488120084 sameAs 1488120084 @default.
- W1488120084 citedByCount "0" @default.
- W1488120084 crossrefType "book" @default.
- W1488120084 hasAuthorship W1488120084A5017120383 @default.
- W1488120084 hasAuthorship W1488120084A5023942331 @default.
- W1488120084 hasConcept C106286213 @default.
- W1488120084 hasConcept C111919701 @default.
- W1488120084 hasConcept C114614502 @default.
- W1488120084 hasConcept C118615104 @default.
- W1488120084 hasConcept C126255220 @default.
- W1488120084 hasConcept C132525143 @default.
- W1488120084 hasConcept C136625980 @default.
- W1488120084 hasConcept C145691206 @default.
- W1488120084 hasConcept C148764684 @default.
- W1488120084 hasConcept C165526019 @default.
- W1488120084 hasConcept C25360446 @default.
- W1488120084 hasConcept C33923547 @default.
- W1488120084 hasConcept C41008148 @default.
- W1488120084 hasConcept C41045048 @default.
- W1488120084 hasConcept C54829058 @default.
- W1488120084 hasConcept C76220878 @default.
- W1488120084 hasConcept C80899671 @default.
- W1488120084 hasConceptScore W1488120084C106286213 @default.
- W1488120084 hasConceptScore W1488120084C111919701 @default.
- W1488120084 hasConceptScore W1488120084C114614502 @default.
- W1488120084 hasConceptScore W1488120084C118615104 @default.
- W1488120084 hasConceptScore W1488120084C126255220 @default.
- W1488120084 hasConceptScore W1488120084C132525143 @default.
- W1488120084 hasConceptScore W1488120084C136625980 @default.
- W1488120084 hasConceptScore W1488120084C145691206 @default.
- W1488120084 hasConceptScore W1488120084C148764684 @default.
- W1488120084 hasConceptScore W1488120084C165526019 @default.
- W1488120084 hasConceptScore W1488120084C25360446 @default.
- W1488120084 hasConceptScore W1488120084C33923547 @default.
- W1488120084 hasConceptScore W1488120084C41008148 @default.
- W1488120084 hasConceptScore W1488120084C41045048 @default.
- W1488120084 hasConceptScore W1488120084C54829058 @default.
- W1488120084 hasConceptScore W1488120084C76220878 @default.
- W1488120084 hasConceptScore W1488120084C80899671 @default.
- W1488120084 hasLocation W14881200841 @default.
- W1488120084 hasOpenAccess W1488120084 @default.
- W1488120084 hasPrimaryLocation W14881200841 @default.
- W1488120084 hasRelatedWork W1531500319 @default.
- W1488120084 hasRelatedWork W1539835668 @default.
- W1488120084 hasRelatedWork W1553557824 @default.
- W1488120084 hasRelatedWork W1578031358 @default.
- W1488120084 hasRelatedWork W1600437548 @default.
- W1488120084 hasRelatedWork W1602816720 @default.
- W1488120084 hasRelatedWork W1604655363 @default.
- W1488120084 hasRelatedWork W1695878779 @default.
- W1488120084 hasRelatedWork W1976584101 @default.
- W1488120084 hasRelatedWork W1994932713 @default.
- W1488120084 hasRelatedWork W2003391451 @default.
- W1488120084 hasRelatedWork W2064625402 @default.
- W1488120084 hasRelatedWork W2075081186 @default.
- W1488120084 hasRelatedWork W2107843968 @default.
- W1488120084 hasRelatedWork W2140566134 @default.
- W1488120084 hasRelatedWork W2150361102 @default.
- W1488120084 hasRelatedWork W2162898372 @default.
- W1488120084 hasRelatedWork W2164859698 @default.
- W1488120084 hasRelatedWork W2170344325 @default.
- W1488120084 hasRelatedWork W53087745 @default.
- W1488120084 isParatext "false" @default.
- W1488120084 isRetracted "false" @default.
- W1488120084 magId "1488120084" @default.
- W1488120084 workType "book" @default.