1. Base polyhedra and the linking property

   • Tamás Király

   OriginalPaper 08 May 2017 Pages: 671 - 677

2. On a general framework for network representability in discrete optimization

   • Yuni Iwamasa

   OriginalPaper 20 May 2017 Pages: 678 - 708

   

3. A compact representation for minimizers of k-submodular functions

   • Hiroshi Hirai
   • Taihei Oki

   OriginalPaper 03 June 2017 Pages: 709 - 741

   

4. An algorithm for finding a representation of a subtree distance

   • Kazutoshi Ando
   • Koki Sato

   OriginalPaper 12 June 2017 Pages: 742 - 762

   

5. Lot sizing with storage losses under demand uncertainty

   • Stefano Coniglio
   • Arie M. C. A. Koster
   • Nils Spiekermann

   OriginalPaper Open access 04 July 2017 Pages: 763 - 788

   

6. ILP formulation of the degree-constrained minimum spanning hierarchy problem

   • Massinissa Merabet
   • Miklos Molnar
   • Sylvain Durand

   OriginalPaper 09 August 2017 Pages: 789 - 811

   

7. Uniqueness of equilibria in atomic splittable polymatroid congestion games

   • Tobias Harks
   • Veerle Timmermans

   OriginalPaper Open access 18 August 2017 Pages: 812 - 830

   

8. Sum-of-squares rank upper bounds for matching problems

   • Adam Kurpisz
   • Samuli Leppänen
   • Monaldo Mastrolilli

   OriginalPaper 06 September 2017 Pages: 831 - 844

9. Robust trading mechanisms over 0/1 polytopes

   • Mustafa Ç. Pınar

   OriginalPaper 22 September 2017 Pages: 845 - 860

10. Optimization problems with color-induced budget constraints

    • Corinna Gottschalk
    • Hendrik Lüthen
    • Andreas Wierz

    OriginalPaper 13 October 2017 Pages: 861 - 870

    

11. Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

    • Sven Mallach

    OriginalPaper 18 November 2017 Pages: 871 - 895

    

12. Planning personnel retraining: column generation heuristics

    • Oliver G. Czibula
    • Hanyu Gu
    • Yakov Zinder

    OriginalPaper 09 February 2018 Pages: 896 - 915

    

13. An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment

    • Diego Recalde
    • Daniel Severín
    • Polo Vaca

    OriginalPaper 09 February 2018 Pages: 916 - 936

    

14. Subset sum problems with digraph constraints

    • Laurent Gourvès
    • Jérôme Monnot
    • Lydia Tlilane

    OriginalPaper 21 February 2018 Pages: 937 - 964

    

15. The QAP-polytope and the graph isomorphism problem

    • Pawan Aurora
    • Shashank K. Mehta

    OriginalPaper 26 February 2018 Pages: 965 - 1006

    

16. The weakly connected independent set polytope in corona and join of graphs

    • F. Bendali
    • J. Mailfert

    OriginalPaper 09 March 2018 Pages: 1007 - 1023

    

17. The min-up/min-down unit commitment polytope

    • Pascale Bendotti
    • Pierre Fouilhoux
    • Cécile Rottner

    OriginalPaper 12 March 2018 Pages: 1024 - 1058

    

18. Approximability and exact resolution of the multidimensional binary vector assignment problem

    • Marin Bougeret
    • Guillerme Duvillié
    • Rodolphe Giroudeau

    OriginalPaper 29 March 2018 Pages: 1059 - 1073

    

19. On the m-clique free interval subgraphs polytope: polyhedral analysis and applications

    • Mohammed-Albarra Hassan
    • Imed Kacem
    • Izzeldin M. Osman

    OriginalPaper 23 April 2018 Pages: 1074 - 1101