default search action
Discrete Applied Mathematics, Volume 196
Volume 196, December 2015
- Silvano Martello, Bernard Ries:
Advances in Combinatorial Optimization. 1-3 - Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. 4-19 - Christoph Dürr, Lukasz Jez, Oscar C. Vásquez:
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. 20-27 - Yakov Zinder, Sam Walker:
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness. 28-53 - Eduard Kh. Gimadi, Alexei N. Glebov, A. A. Skretneva, O. Yu. Tsidulko, D. Zh. Zambalaeva:
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. 54-61 - Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover problem. 62-71 - Jacek Blazewicz, Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram:
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators. 72-82 - Daniel Cosmin Porumbel, Gilles Goncalves:
Using dual feasible functions to construct fast lower bounds for routing and location problems. 83-99 - Virginie Gabrel, Maude Manouvrier, Cécile Murat:
Web services composition: Complexity and models. 100-114 - Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
About the minimum mean cycle-canceling algorithm. 115-134 - Lilian Markenzon, Christina Fraga Esteves Maciel Waga:
New results on ptolemaic graphs. 135-140
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.