External Links

    Journal: Discrete Optimization

    Volume 8, Issue 4

    513 -- 524Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo. Coordination mechanisms with hybrid local policies
    525 -- 539Sylvia Boyd, Robert Carr. Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
    540 -- 554Diego Delle Donne, Javier Marenco. A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
    555 -- 567Dror Rawitz, Shimon Shahar. Partial multicovering and the d-consecutive ones property
    568 -- 594Joachim Kneis, Alexander Langer, Peter Rossmanith. Courcelle's theorem - A game-theoretic approach
    595 -- 610Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch. Orbitopal fixing

    Volume 8, Issue 3

    393 -- 410Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard. Valid inequalities and branch-and-cut for the clique pricing problem
    411 -- 416Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger. The Wiener maximum quadratic assignment problem
    417 -- 427Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth. New bounds on the average distance from the Fermat-Weber center of a planar convex body
    428 -- 445Hiroshi Hirai, Shungo Koichi. On duality and fractionality of multicommodity flows in directed networks
    446 -- 451Günes Erdogan, Barbaros Ç. Tansel. Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
    452 -- 458Yair Caro, Michael A. Henning. A Greedy Partition Lemma for directed domination
    478 -- 494Tim Januschowski, Marc E. Pfetsch. The maximum k-colorable subgraph problem and orbitopes
    495 -- 501Teresa W. Haynes, Michael A. Henning, Anders Yeo. A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
    502 -- 512Sivan Altinakar, Gilles Caporossi, Alain Hertz. On compact k-edge-colorings: A polynomial time reduction from linear to cyclic

    Volume 8, Issue 2

    147 -- 159Andrew Gilpin, Tuomas Sandholm. Information-theoretic approaches to branching in search
    160 -- 173Alexander G. Nikolaev, Sheldon H. Jacobson. Using Markov chains to analyze the effectiveness of local search algorithms
    174 -- 190Enrico Malaguti, Michele Monaci, Paolo Toth. An exact approach for the Vertex Coloring Problem
    191 -- 205Ruonan Zhang, Santosh N. Kabadi, Abraham P. Punnen. The minimum spanning tree problem with conflict constraints and its variations
    206 -- 214Jácint Szabó. Upgrading edge-disjoint paths in a ring
    215 -- 228Marius Posta, Jacques A. Ferland, Philippe Michelon. Generalized resolution search
    229 -- 245Ricardo Fukasawa, Oktay Günlük. Strengthening lattice-free cuts using non-negativity
    246 -- 258Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard. An exact algorithm for the network pricing problem
    259 -- 276Bo Zeng, Jean-Philippe P. Richard. A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting
    277 -- 301Bo Zeng, Jean-Philippe P. Richard. A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting
    302 -- 314Nili Guttmann-Beck, Refael Hassin. On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
    315 -- 332Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli. Cutting stock with no three parts per pattern: Work-in-process and pattern minimization
    333 -- 343Leah Epstein, Lene M. Favrholdt, Asaf Levin. Online variable-sized bin packing with conflicts
    344 -- 375Mourad Baïou, Francisco Barahona. On the linear relaxation of the p-median problem
    376 -- 384Olawale Titiloye, Alan Crispin. Quantum annealing of the graph coloring problem
    385 -- 392Dinakar Gade, Simge Küçükyavuz. A Note on Lot-sizing with fixed charges on stocks: The convex hull

    Volume 8, Issue 1

    1 -- 0Michael R. Fellows, Fedor V. Fomin, Gregory Gutin. Special Issue on Parameterized Complexity of Discrete Optimization
    2 -- 17Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. Graph-based data clustering with overlaps
    18 -- 24Peter Damaschke. Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
    25 -- 40Dániel Marx, Ildikó Schlotter. Stable assignment with couples: Parameterized complexity and local search
    41 -- 49Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege. Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
    50 -- 60Sylvain Guillemot. Parameterized complexity and approximability of the Longest Compatible Sequence problem
    61 -- 71Sylvain Guillemot. FPT algorithms for path-transversal and cycle-transversal problems
    72 -- 86Petr A. Golovach, Dimitrios M. Thilikos. Paths of bounded length and their cuts: Parameterized complexity and algorithms
    87 -- 96Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman. Treewidth governs the complexity of target set selection
    97 -- 109Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. On the directed Full Degree Spanning Tree problem
    110 -- 128Neeldhara Misra, Venkatesh Raman, Saket Saurabh. Lower bounds on kernelization
    129 -- 138Michael Lampis, Georgia Kaouri, Valia Mitsou. On the algorithmic effectiveness of digraph decompositions and complexity measures
    139 -- 145Stefan Szeider. The parameterized complexity of k-flip local search for SAT and MAX SAT
    runs on