Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase High-multiplicity (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2008 (17) 2009-2020 (15) 2021-2024 (11)
Publication types (Num. hits)
article(33) inproceedings(8) phdthesis(2)
Venues (Conferences, Journals, ...)
CoRR(5) J. Sched.(5) Math. Program.(3) Oper. Res.(3) AAMAS(2) J. Comb. Optim.(2) J. Oper. Res. Soc.(2) Oper. Res. Lett.(2) AAAI(1) ACL (2)(1) Algorithmica(1) Ann. Oper. Res.(1) Asia Pac. J. Oper. Res.(1) Auton. Agents Multi Agent Syst...(1) Discret. Appl. Math.(1) Discret. Optim.(1) More (+10 of total 25)
Authors
Dusan Knop(5) Andrzej Kaczmarczyk 0001(4) Robert Bredereck(4) Rolf Niedermeier(4) Alexander Grigoriev(3) Carlo Filippi(3) Michaël Gabay(3) Paolo Detti(3) Alessandro Agnetis(2) Dan Klein(2) Edith Hemaspaandra(2) Frieda Granot(2) Gianfranco Ciaschetti(2) Hanif D. Sherali(2) Jadranka Skorin-Kapov(2) John J. Clifford(2) More (+10 of total 82)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 11 keywords
Results
Found 43 publication records. Showing 43 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
67Carlo Filippi, Giorgio Romanin-Jacur Exact and approximate algorithms for high-multiplicity parallel machine scheduling. Search on Bibsonomy J. Sched. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Scheduling, Computational complexity, Parallel machines, High-multiplicity
56Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert A Framework for the Complexity of High-Multiplicity Scheduling Problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF scheduling, computational complexity, design of algorithms, high multiplicity
38Paolo Detti Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions. Search on Bibsonomy J. Sched. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiprocessor scheduling, Polynomial algorithms, High multiplicity
38Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. Search on Bibsonomy J. Sched. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multiprocessor scheduling, polynomial algorithms, high-multiplicity
37Michaël Gabay High-Multiplicity Scheduling and Packing Problems. (Ordonnancement et Conditionnement en High-Multiplicity). Search on Bibsonomy 2014   RDF
29Carlo Filippi, Alessandro Agnetis An asymptotically exact algorithm for the high-multiplicity bin packing problem. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
27Gianfranco Ciaschetti, Lorenzo Corsini, Paolo Detti, Giovanni Giambene Packet scheduling in third-generation mobile systems with UTRA-TDD air interface. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Scheduling, Algorithms, UMTS, High-multiplicity
18Pablo Cubillos, Julián López-Gómez, Andrea Tellini High multiplicity of positive solutions in a superlinear problem of Moore-Nehari type. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
18Nikita Morozov, Artur Ignatiev, Yuriy Dementiev Several Stories about High-Multiplicity EFx Allocation (Student Abstract). Search on Bibsonomy AAAI The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
18Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn High-multiplicity N-fold IP via configuration LP. Search on Bibsonomy Math. Program. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Robert Bredereck, Andrzej Kaczmarczyk 0001, Dusan Knop, Rolf Niedermeier High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. Search on Bibsonomy ECAI The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Caixia Jing, Wanzhen Huang, Lei Zhang, Heng Zhang Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times. Search on Bibsonomy Asia Pac. J. Oper. Res. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Hauke Brinkop, Klaus Jansen High Multiplicity Scheduling on Uniform Machines in FPT-Time. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18David Fischer, Julian Golak, Matthias Mnich Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu High Multiplicity Strip Packing with Three Rectangle Types. Search on Bibsonomy ISCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Steven J. Edwards, Davaatseren Baatar, Kate Smith-Miles, Andreas T. Ernst Symmetry breaking of identical projects in the high-multiplicity RCPSP/max. Search on Bibsonomy J. Oper. Res. Soc. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
18Amir Hossein Gharehgozli 0001, Chao Xu 0002, Wenda Zhang High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
18Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk 0001, Dusan Knop, Rolf Niedermeier High-Multiplicity Fair Allocation Made More Practical. (PDF / PS) Search on Bibsonomy AAMAS The full citation details ... 2021 DBLP  BibTeX  RDF
18Robert Bredereck, Andrzej Kaczmarczyk 0001, Dusan Knop, Rolf Niedermeier High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
18Zack Fitzsimmons, Edith Hemaspaandra High-multiplicity election problems. Search on Bibsonomy Auton. Agents Multi Agent Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
18Robert Bredereck, Andrzej Kaczmarczyk 0001, Dusan Knop, Rolf Niedermeier High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. Search on Bibsonomy EC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
18Maichel M. Aguayo, Subhash C. Sarin, Hanif D. Sherali Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions. Search on Bibsonomy J. Oper. Res. Soc. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
18Zack Fitzsimmons, Edith Hemaspaandra High-Multiplicity Election Problems. Search on Bibsonomy AAMAS The full citation details ... 2018 DBLP  BibTeX  RDF
18Maxim Rabinovich, Dan Klein Fine-Grained Entity Typing with High-Multiplicity Assignments. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
18Maxim Rabinovich, Dan Klein Fine-Grained Entity Typing with High-Multiplicity Assignments. Search on Bibsonomy ACL (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
18Michaël Gabay, Christophe Rapine, Nadia Brauner High-multiplicity scheduling on one machine with forbidden start and completion times. Search on Bibsonomy J. Sched. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
18Michael Masin, Tal Raviv Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem. Search on Bibsonomy J. Sched. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
18Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk High Multiplicity Scheduling with Switching Costs for Few Products. Search on Bibsonomy OR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
18Subhash C. Sarin, Hanif D. Sherali, Liming Yao New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem. Search on Bibsonomy Optim. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
18Matthaios Katsanikas, P. A. Patsis, A. D. Pinotsis Chains of rotational Tori and Filamentary Structures Close to High Multiplicity periodic orbits in a 3D Galactic Potential. Search on Bibsonomy Int. J. Bifurc. Chaos The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
18Carlo Filippi An approximate algorithm for a high-multiplicity parallel machine scheduling problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
18Tracy Kimbrel, Maxim Sviridenko High-multiplicity cyclic job shop scheduling. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Maria J. Serna, Fatos Xhafa Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Vassilissa Lehoux-Lebacque Théorie et applications en ordonnancement : contraintes de ressources et tâches agrégées en catégories. (Theory and application in scheduling: resource constraints and high multiplicity). Search on Bibsonomy 2007   RDF
18Alexander Grigoriev, Joris van de Klundert On the high multiplicity traveling salesman problem. Search on Bibsonomy Discret. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Dimitris Bertsimas, David Gamarnik, Jay Sethuraman From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective. Search on Bibsonomy Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
18John J. Clifford, Marc E. Posner Parallel machine scheduling with high multiplicity. Search on Bibsonomy Math. Program. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18John J. Clifford, Marc E. Posner High Multiplicity in Earliness-Tardiness Scheduling. Search on Bibsonomy Oper. Res. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. Search on Bibsonomy Algorithmica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
18Frieda Granot, Jadranka Skorin-Kapov On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
18Dorit S. Hochbaum, Ron Shamir Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem. Search on Bibsonomy Oper. Res. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
11C. T. Ng 0001, T. C. Edwin Cheng, Jinjiang Yuan A note on the complexity of the problem of two-agent scheduling on a single machine. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Production/scheduling, Multi-agent deterministic sequencing, Games/group decisions, Cooperative sequencing
11Fred Daneshgaran, Marina Mondin, Paolo Mulassano Linear subcodes of turbo codes with improved distance spectra. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #43 of 43 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license