Volume 5,
Number 1,
February 2008
- Yoshio Okamoto:
Fair cost allocations under conflicts - a game-theoretic point of view - .
1-18
- Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh:
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.
19-35
- Akimichi Takemura, Ruriko Yoshida:
A generalization of the integer linear infeasibility problem.
36-52
- Yael Berstein, Shmuel Onn:
Nonlinear bipartite matching.
53-65
- Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max (regret) versions of min cut problems.
66-73
- Cláudio Nogueira de Meneses, Panos M. Pardalos, Michelle A. Ragle:
Asynchronous Teams for probe selection problems.
74-87
- Leah Epstein, Asaf Levin:
A PTAS for delay minimization in establishing wireless conference calls.
88-96
- Asaf Levin, Michal Penn:
Approximation algorithm for minimizing total latency in machine scheduling with deliveries.
97-107
- Ray Pörn, Kaj-Mikael Björk, Tapio Westerlund:
Global solution of optimization problems with signomial parts.
108-120
- Jørgen Bang-Jensen, Morten Hegner Nielsen:
Minimum cycle factors in quasi-transitive digraphs.
121-137
- Kevin K. H. Cheung:
Solving mirrored traveling tournament problem benchmark instances with eight teams.
138-143
Volume 5,
Number 2,
May 2008
- Egon Balas, Alan J. Hoffman, S. Thomas McCormick:
A Special Issue in Memory of George B. Dantzig.
145-150
- Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright:
George B. Dantzig and systems optimization.
151-158
- Kenneth J. Arrow:
George Dantzig in the development of economic analysis.
159-167
- Martin Grötschel, George L. Nemhauser:
George Dantzig's contributions to integer programming.
168-173
- Richard M. Karp:
George Dantzig's impact on the theory of computation.
174-185
- Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter:
An algorithmic framework for convex mixed integer nonlinear programs.
186-204
- Mourad Baïou, Francisco Barahona:
On the p-median polytope of Y-free graphs.
205-219
- Adam N. Letchford, Nicholas A. Pearson:
Exploiting planarity in separation routines for the symmetric traveling salesman problem.
220-230
- Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-fold integer programming.
231-241
- Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang:
The inverse 1-median problem on a cycle.
242-253
- Todd Easton, Kevin Hooker:
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes.
254-261
- Matteo Fischetti, Michele Monaci:
How tight is the corner relaxation?
262-269
- Hanif D. Sherali, Fred Glover:
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities.
270-289
- Kathie Cameron, Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph.
290-292
- Matthias Köppe, Quentin Louveaux, Robert Weismantel:
Intermediate integer programming representations using value disjunctions.
293-313
- Esther M. Arkin, Refael Hassin:
The k-path tree matroid and its applications to survivable network design.
314-322
- Noga Alon, Eli Berger:
The Grothendieck constant of random and pseudo-random graphs.
323-327
- Oktay Günlük:
A pricing problem under Monge property.
328-336
- Robert G. Bland, Brenda L. Dietrich:
A unified interpretation of several combinatorial dualities.
337-349
- Maria Teresa Godinho, Luis Gouveia, Thomas L. Magnanti:
Combined route capacity and route length models for unit demand vehicle routing problems.
350-372
- Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem.
373-388
- Daniel Bienstock, Nuri Özbay:
Computing robust basestock levels.
389-414
- Alper Atamtürk, Deepak Rajan:
Partition inequalities for capacitated survivable network design based on directed p-cycles.
415-433
- Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki:
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
434-456
- Uriel G. Rothblum, Jay Sethuraman:
Stochastic scheduling in an in-forest.
457-466
- Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser:
Nonconvex, lower semicontinuous piecewise linear optimization.
467-488
- Ulrich Faigle, Britta Peis:
Note on pseudolattices, lattices and submodular linear programs.
489-500
- Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares:
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO).
501-529
- Marcia Fampa, Kurt M. Anstreicher:
An improved algorithm for computing Steiner minimal trees in Euclidean d-space.
530-540
- Brady Hunsaker, Ellis L. Johnson, Craig A. Tovey:
Polarity and the complexity of the shooting experiment.
541-549
- James B. Orlin, Andreas S. Schulz, Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
550-561
Volume 5,
Number 3,
August 2008
- Yochai Twitto:
Dominance guarantees for above-average solutions.
563-568
- Renato Bruni, Andrea Santori:
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability.
569-583
- Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich:
Approximability results for the maximum and minimum maximal induced matching problems.
584-593
- T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, S. S. Lam:
Group sequencing around a common due date.
594-604
- Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras, Konstantinos Stergiou:
Worst case examples of an exterior point algorithm for the assignment problem.
605-614
- Bernard Gendron, Alain Hertz, Patrick St-Louis:
A sequential elimination algorithm for computing bounds on the clique number of a graph.
615-628
- Jérôme Truffot, Christophe Duhamel:
A Branch and Price algorithm for the k-splittable maximum flow problem.
629-646
- Daniel Berend, Ephraim Korach, Shira Zucker:
Anticoloring of a family of grid graphs.
647-662
Volume 5,
Number 4,
November 2008
- Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti:
Recent results on well-balanced orientations.
663-676
- András Frank, László A. Végh:
An algorithm to increase the node-connectivity of a digraph by one.
677-684
- Louis-Philippe Bigras, Michel Gamache, Gilles Savard:
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times.
685-699
- Hung-Lin Fu, Frank K. Hwang:
A new construction of I-separable matrices via an improved decoding of Macula's construction.
700-704
- Leah Epstein, Asaf Levin:
More on online bin packing with two item sizes.
705-713
- Sonia, Ankit Khandelwal, M. C. Puri:
Bilevel time minimizing transportation problem.
714-723
- Yanjun Li, Jean-Philippe P. Richard:
Cook, Kannan and Schrijver's example revisited.
724-734
- Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli:
A dual ascent procedure for the set partitioning problem.
735-747
- Jianxin Wang, Yunlong Liu:
Parameterized algorithms for weighted matching and packing problems.
748-754
- Tarik Belgacem, Mhand Hifi:
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.
755-761
Last update Wed Feb 15 05:30:39 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
