Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
145 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 789-798, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
109 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
71 | Angelos Tsoukalas, Panos Parpas, Berç Rustem |
A smoothing algorithm for finite min-max-min problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(1), pp. 49-62, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 428-438, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas |
50 | Angelos Tsoukalas, Berç Rustem, Efstratios N. Pistikopoulos |
A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 44(2), pp. 235-250, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Generalized semi-infinite, Bi-level, Globaloptimization, Min-max-min, Minimax |
43 | Hui-juan Xiong, Bo Yu 0003 |
An aggregate deformation homotopy method for min-max-min problems with max-min constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 47(3), pp. 501-527, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Jourdain B. Lamperski, Oleg A. Prokopyev, Luca G. Wrabetz |
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 33(3), pp. 2435-2456, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Jannis Kurtz |
New complexity results and algorithms for min-max-min robust combinatorial optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.03107, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | André B. Chassein, Marc Goerigk |
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 296, pp. 141-163, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Alejandro Crema |
Min max min robust (relative) regret combinatorial optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Methods Oper. Res. ![In: Math. Methods Oper. Res. 92(2), pp. 249-283, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Marc Goerigk, Jannis Kurtz, Michael Poss |
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 285, pp. 707-725, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss |
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 279(2), pp. 308-319, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Buchheim, Jannis Kurtz |
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 28, pp. 1-15, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Youngchae Cho, Takayuki Ishizaki, Masakazu Koike, Nacim Ramdani, Jun-ichi Imura |
Min-max-min Robust optimization for Adaptivity-Constrained Economic Dispatch. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECC ![In: 16th European Control Conference, ECC 2018, Limassol, Cyprus, June 12-15, 2018, pp. 1-6, 2018, IEEE, 978-3-9524-2698-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Yan Li, Zhunge Zhu, Yong Wang |
MIN-Max-Min: A Heuristic Scheduling Algorithm for Jobs across Geo-Distributed Datacenters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 38th IEEE International Conference on Distributed Computing Systems, ICDCS 2018, Vienna, Austria, July 2-6, 2018, pp. 1573-1574, 2018, IEEE Computer Society, 978-1-5386-6871-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Buchheim, Jannis Kurtz |
Min-max-min robust combinatorial optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 163(1-2), pp. 1-23, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Buchheim, Jannis Kurtz |
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 52, pp. 45-52, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Dexin Cao, Meirong Chen, Haijun Wang, Ji Jianxiong |
Interval method for global solutions of a class of min-max-min problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 196(2), pp. 594-602, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Michel Minoux |
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 45(1-3), pp. 361-372, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell |
Algorithms for two-box covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 459-467, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
exact and approximate algorithms |
19 | María M. López, Elisa Heymann, Miquel A. Senar |
Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 5th International Symposium on Parallel and Distributed Computing (ISPDC 2006), 6-9 July 2006, Timisoara, Romania, pp. 199-207, 2006, IEEE Computer Society, 0-7695-2638-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Grid, Workflows |
19 | Sung Chune Choi, Hee Yong Youn |
Task Mapping Algorithm for Heterogeneous Computing System Allowing High Throughput and Load Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part III, pp. 1000-1003, 2005, Springer, 3-540-26044-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scheduling, load balancing, throughput, Heterogeneous computing, task mapping |
19 | Tracy D. Braun, Howard Jay Siegel, Noah Beck, Ladislau Bölöni, Muthucumaru Maheswaran, Albert I. Reuther, James P. Robertson, Mitchell D. Theys, Bin Yao, Debra A. Hensgen, Richard F. Freund |
A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Heterogeneous Computing Workshop ![In: 8th Heterogeneous Computing Workshop, HCW 1999, San Juan, Puerto Rico, April12, 1999, pp. 15-29, 1999, IEEE Computer Society, 0-7695-0107-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|