default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 9
Volume 9, Number 1, February 2012
- Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen
, Frits C. R. Spieksma:
Computer-assisted proof of performance ratios for the Differencing Method. 1-16 - David Romero, Federico Alonso-Pecina:
Ad hoc heuristic for the cover printing problem. 17-28 - F. J. Hwang, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. 29-39 - Egon Balas, Andrea Qualizza:
Monoidal cut strengthening revisited. 40-49 - Bang Ye Wu:
On the maximum disjoint paths problem on edge-colored graphs. 50-57
- Igor Averbakh:
Emergency path restoration problems. 58-64
Volume 9, Number 2, May 2012
- Yijia Zhao, Diego Klabjan:
A polyhedral study of lot-sizing with supplier selection. 65-76 - Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
On dynamic monopolies of graphs: The average and strict majority thresholds. 77-83 - Foad Mahdavi Pajouh, Balabhaskar Balasundaram:
On inclusionwise maximal and maximum cardinality k-clubs in graphs. 84-97 - Yusuke Kobayashi, Xin Yin:
An algorithm for finding a maximum t-matching excluding complete partite subgraphs. 98-108 - Gérard Cornuéjols, Carla Michini, Giacomo Nannicini:
How tight is the corner relaxation? Insights gained from the stable set problem. 109-121 - Sezer Sorgun, Serife Büyükköse:
On the bounds for the largest Laplacian eigenvalues of weighted graphs. 122-129
- Fabio Furini, Enrico Malaguti:
Exact weighted vertex coloring via branch-and-price. 130-136
Volume 9, Number 3, August 2012
- Johannes Hatzl:
2-balanced flows and the inverse 1-median problem in the Chebyshev space. 137-148 - Gilberto Calvillo, David Romero:
The dominance assignment problem. 149-158 - Bala Krishnamoorthy, William Webb, Nathan Moyer:
Lattice-based algorithms for number partitioning in the hard phase. 159-171 - Siqian Shen, J. Cole Smith, Roshan Goli:
Exact interdiction models and algorithms for disconnecting networks via node deletions. 172-188 - Marcus Oswald, Gerhard Reinelt, Stefan Wiesberg:
Exact solution of the 2-dimensional grid arrangement problem. 189-199
- Malgorzata Sulkowska:
The best choice problem for upward directed graphs. 200-204 - Abraham P. Punnen, Ruonan Zhang:
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem. 205-208
Volume 9, Number 4, November 2012
- Gennadiy Averkov:
On finitely generated closures in the theory of cutting planes. 209-215 - Sujeevraja Sanjeevi, Kiavash Kianfar:
Mixed n-step MIR inequalities: Facets for the n-mixing set. 216-235 - Patrick St-Louis, Bernard Gendron, Alain Hertz:
Total domination and the Caccetta-Häggkvist conjecture. 236-240 - Dvir Shabtay, Shlomo Karhi:
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. 241-248 - Katarína Cechlárová, Eva Pillárová:
On the computability of equitable divisions. 249-257 - Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-capacitated spanning tree problem. 258-266
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 2026-06-23 01:02 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:
