default search action
Discrete Optimization, Volume 25
Volume 25, August 2017
- Xue-Gang Chen, Kai Yin, Ting Gao:
A note on independent vertex-edge domination in graphs. 1-5 - Alexandre Skoda:
Inheritance of convexity for partition restricted games. 6-27 - Yves Crama, Elisabeth Rodríguez-Heck:
A class of valid inequalities for multilinear 0-1 optimization problems. 28-47 - Matthias Mnich, Erik Jan van Leeuwen:
Polynomial kernels for deletion to classes of acyclic digraphs. 48-76 - Alexander Chane Shiau, Tzong-Huei Shiau, Yue-Li Wang:
Efficient absorbants in generalized de Bruijn digraphs. 77-85 - Ibrahima Diarrassouba:
On the complexity of the separation problem for rounded capacity inequalities. 86-104 - Yuan Gao, Jinjiang Yuan:
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. 105-119 - Michael Malmros Sørensen:
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes. 120-140 - Alberto Costa, Tsan Sheng Ng, Lin Xuan Foo:
Complete mixed integer linear programming formulations for modularity density based clustering. 141-158 - Laura Galli, Adam N. Letchford:
On the Lovász theta function and some variants. 159-174 - Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey:
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. 175-188
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.