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. |
ISAAC |
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. |
ESA |
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. |
Optim. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. |
COCOON |
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. |
J. Glob. Optim. |
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. |
Comput. Optim. Appl. |
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. |
SIAM J. Optim. |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Jannis Kurtz |
New complexity results and algorithms for min-max-min robust combinatorial optimization. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
26 | André B. Chassein, Marc Goerigk |
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Alejandro Crema |
Min max min robust (relative) regret combinatorial optimization. |
Math. Methods Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Marc Goerigk, Jannis Kurtz, Michael Poss |
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. |
Discret. Appl. Math. |
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. |
Eur. J. Oper. Res. |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Buchheim, Jannis Kurtz |
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. |
Discret. Optim. |
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. |
ECC |
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. |
ICDCS |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Christoph Buchheim, Jannis Kurtz |
Min-max-min robust combinatorial optimization. |
Math. Program. |
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. |
Electron. Notes Discret. Math. |
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. |
Appl. Math. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Michel Minoux |
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. |
Math. Program. |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell |
Algorithms for two-box covering. |
SCG |
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. |
ISPDC |
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. |
International Conference on Computational Science (3) |
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. |
Heterogeneous Computing Workshop |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|