default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 10
Volume 10, Number 1, February 2013
- Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
One-level reformulation of the bilevel Knapsack problem using dynamic programming. 1-10 - Hao-Chun Lu
:
A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions. 11-24 - Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit:
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. 25-41 - Yunqiang Yin, T. C. E. Cheng, Jiayin Wang, Chin-Chia Wu:
Single-machine common due window assignment and scheduling to minimize the total cost. 42-53 - Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. 54-60 - Imed Kacem, Vangelis Th. Paschos:
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. 61-68 - Robert Hildebrand, Matthias Köppe:
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn). 69-84
Volume 10, Number 2, May 2013
- R. Chandrasekaran, K. Subramani:
A combinatorial algorithm for Horn programs. 85-101 - Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins:
Branch decomposition heuristics for linear matroids. 102-119 - Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo:
Bike sharing systems: Solving the static rebalancing problem. 120-146 - Asaf Levin, Aleksander Vainer:
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. 147-154 - Sven Oliver Krumke, Christiane Zeck:
Generalized max flow in series-parallel graphs. 155-162 - Andreas S. Schulz, Nelson A. Uhan:
Approximating the least core value and least core of cooperative games with supermodular costs. 163-180 - Julien Roland, José Rui Figueira, Yves De Smet:
The inverse {0, 1}{0, 1}-knapsack problem: Theory, algorithms and computational experiments. 181-192
Volume 10, Number 3, August 2013
- Stefan Kratsch, Magnus Wahlström:
Two edge modification problems without polynomial kernels. 193-199 - Abraham P. Punnen, Santosh N. Kabadi:
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems. 200-209 - Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori:
Exact algorithms for the bin packing problem with fragile objects. 210-223 - Tiru S. Arthanari:
Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope. 224-232
Volume 10, Number 4, November 2013
- Kun Meng, Chuang Lin, Yang Yang:
Minimum number of queries for an adaptive liar search game with small sets. 233-240 - Christophe Rapine, Nadia Brauner:
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. 241-250 - Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine:
A polynomial time algorithm for unloading boxes off a gravity conveyor. 251-262 - Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A computational comparison of flow formulations for the capacitated location-routing problem. 263-295 - Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries:
Perfectness of clustered graphs. 296-303 - Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Sparse regular induced subgraphs in 2P3-free graphs. 304-309 - Sven Herrmann, Vincent Moulton, Andreas Spillner:
Searching for realizations of finite metric spaces in tight spans. 310-319 - Mhand Hifi, Hedi M'Halla:
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. 320-330 - Noriyoshi Sukegawa, Atsushi Miyauchi:
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. 331-332 - Refael Hassin, Ohad Schneider:
A local search algorithm for binary maximum 2-path partitioning. 333-360 - Chandrashekhar Nagarajan, David P. Williamson:
Offline and online facility leasing. 361-370 - Takuro Fukunaga:
Computing minimum multiway cuts in hypergraphs. 371-382
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-05-14 22:10 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:
