default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 6
Volume 6, Number 1, February 2009
- Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. 1-9 - Yann Hendel, Nina Runge, Francis Sourd:
The one-machine just-in-time scheduling problem with preemption. 10-22 - Toshimasa Ishii:
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. 23-36 - Hiroo Saito, Tetsuya Fujie, Tomomi Matsui
, Shiro Matuura:
A study of the quadratic semi-assignment polytope. 37-50 - Javier Marenco, Annegret Wagler:
Cycle-based facets of chromatic scheduling polytopes. 51-63 - Javier Marenco, Annegret Wagler:
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques. 64-78 - Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. 79-91 - Maxim A. Babenko, Alexander V. Karzanov:
Minimum mean cycle problem in bidirected and skew-symmetric graphs. 92-97 - Christian Liebchen, Leon Peeters:
Integral cycle bases for cyclic timetabling. 98-109 - Vincent Poirriez, Nicola Yanev, Rumen Andonov:
A hybrid algorithm for the unbounded knapsack problem. 110-124 - Sanming Zhou:
Minimum partition of an independence system into independent sets. 125-133
Volume 6, Number 2, May 2009
- Pierre Hansen, Martine Labbé, David Schindl:
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. 135-147 - Jonna Gill, Svante Linusson:
The k-assignment polytope. 148-161 - Gabriela R. Argiroffo, Silvia M. Bianchi:
On the set covering polyhedron of circulant matrices. 162-173 - Nthabiseng Ntene, Jan H. van Vuuren:
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. 174-188 - Kevin K. H. Cheung:
A Benders approach for computing lower bounds for the mirrored traveling tournament problem. 189-196 - Refael Hassin, Asaf Levin, Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover. 197-205 - Yu Hin Au, Levent Tunçel:
On the polyhedral lift-and-project methods and the fractional stable set polytope. 206-213 - Wayne Pullan:
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. 214-219 - Sergey I. Veselov, A. J. Chirkov:
Integer program with bimodular matrix. 220-222
Volume 6, Number 3, August 2009
- Dirk Räbiger, Rainer Schrader:
Semi-preemptive routing on a linear and circular track. 223-230 - Janez Povh, Franz Rendl:
Copositive and semidefinite relaxations of the quadratic assignment problem. 231-241 - Bala Krishnamoorthy, Gábor Pataki:
Column basis reduction and decomposable knapsack problems. 242-270 - Samuel Fiorini, Odile Marcotte:
On the feedback vertex set polytope of a series-parallel graph. 271-287 - Andrew Solomon, Bruce W. Colletti:
Quasiabelian landscapes of the traveling salesman problem are elementary. 288-291 - Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions. 292-298 - Daniel Oron, George Steiner, Vadim G. Timkovsky:
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. 299-309 - Klaus Jansen, Roberto Solis-Oba:
Rectangle packing with one-dimensional resource augmentation. 310-323 - Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars. 324-332
Volume 6, Number 4, November 2009
- Alper Atamtürk, Vishnu Narayanan:
The submodular knapsack polytope. 333-344 - Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi:
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. 345-361 - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Graph coloring with cardinality constraints on the neighborhoods. 362-369 - Snezana Mitrovic-Minic, Abraham P. Punnen:
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. 370-377 - Vladimir Kolmogorov, Akiyoshi Shioura:
New algorithms for convex cost tension problem with application to computer vision. 378-393 - Dimitris Magos, Ioannis Mourtos:
Clique facets of the axial and planar assignment polytopes. 394-413 - Alexander Grigoriev, Marc Uetz:
Scheduling jobs with time-resource tradeoff via nonlinear programming. 414-419 - Z. Caner Taskin, J. Cole Smith, Shabbir Ahmed, Andrew J. Schaefer:
Cutting plane algorithms for solving a stochastic edge-partition problem. 420-435 - Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski:
Chip firing and all-terminal network reliability bounds. 436-445 - Irina N. Lushchakova:
Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines. 446-460
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-10-22 02:14 CEST 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:
