Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 22
Volume 22, Part A, November 2016
- Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub:
Preface. 1-5 - Luérbio Faria, Wing-Kai Hon
, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang:
On complexities of minus domination. 6-19 - Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric multiroute flow and its application to multilink-attack network. 20-36 - Michael Jünger, Sven Mallach:
An integer programming approach to optimal basic block instruction scheduling for single-issue processors. 37-65 - Pascale Bendotti, Pierre Fouilhoux:
Feasibility recovery for the Unit-capacity Constrained Permutation Problem. 66-86 - Fatiha Bendali, Jean Mailfert, Djelloul Mameri:
The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut. 87-110 - Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential fixed-parameter algorithms for partial vector domination. 111-121 - Marta M. B. Pascoal, Marisa Resende:
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. 122-140 - Cristina G. Fernandes, Carlos E. Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. 141-161 - Yong-Hong Kuo, Janny M. Y. Leung:
On the mixed set covering, packing and partitioning polytope. 162-182 - Matteo Fischetti:
Fast training of Support Vector Machines with Gaussian kernel. 183-194 - Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Mixed-integer linear programming heuristics for the prepack optimization problem. 195-205 - Mourad Baïou, Francisco Barahona:
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. 206-224 - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Progress on the description of identifying code polyhedra for some families of split graphs. 225-240 - Péter Biró, Tamás Fleiner:
Fractional solutions for capacitated NTU-games, with applications to stable matchings. 241-254 - Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau:
On the complexity of Wafer-to-Wafer Integration. 255-269 - Babak Samadi:
On the k-limited packing numbers in graphs. 270-276 - Attila Bernáth, Gyula Pap:
Blocking unions of arborescences. 277-290 - H. Paul Williams, John N. Hooker:
Integer programming as projection. 291-311 - Vladimir Shenmaier:
An approximation algorithm for the Euclidean incremental median problem. 312-327 - Ehab Morsy:
Approximating the k-splittable capacitated network design problem. 328-340 - Pietro Belotti, Banu Soylu, Margaret M. Wiecek:
Fathoming rules for biobjective mixed integer linear programs: Review and extensions. 341-363 - Eleazar Madriz Lozada:
Duality for a b-complementary multisemigroup master problem. 364-371 - Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini:
Constrained domatic bipartition on trees. 372-388
a service of 
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 2024-05-03 20:46 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:
