| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Igor Averbakh |
Emergency path restoration problems.  |
Discrete Optimization  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Mehmet Baysan |
Semi-online two-level supply chain scheduling problems. |
J. Scheduling |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Yun-Bin Zhao |
Robust univariate spline models for interpolating interval data. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jordi Pereira, Igor Averbakh |
Exact and heuristic algorithms for the interval data robust assignment problem. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Minmax regret bottleneck problems with solution-induced interval uncertainty structure. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
On-line integrated production-distribution scheduling problems with capacitated deliveries. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Nash equilibria in competitive project scheduling. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Yun-Bin Zhao |
Relaxed robust second-order-cone programming. |
Applied Mathematics and Computation |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Yun-Bin Zhao |
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets. |
SIAM Journal on Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky |
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Zhihui Xue |
On-line supply chain scheduling problems with preemption. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Vasilij Lebedev |
The competitive salesman problem on a network: a worst-case approach. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
The minmax regret permutation flow-shop problem with two jobs. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Ilya Chernykh |
The routing open-shop problem on a network: Complexity and approximation. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasilij Lebedev, Igor Averbakh |
Complexity of minimizing the total flow time with interval data and minmax regret criterion. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Ilya Chernykh |
The m-machine flowshop problem with unit-time operations and intree precedence constraints. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Computing and minimizing the relative regret in combinatorial optimization with interval data. |
Discrete Optimization |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Sergey Bereg |
Facility location problems with uncertainty on the plane. |
Discrete Optimization |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Ilya Chernykh |
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Vasilij Lebedev |
On the complexity of minmax regret linear programming. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
The Minmax Relative Regret Median Problem on Networks. |
INFORMS Journal on Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Minmax regret linear resource allocation problems. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Vasilij Lebedev |
Interval data minmax regret network optimization problems. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
An improved algorithm for the minmax regret median problem on a tree. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Minmax p-Traveling Salesmen Location Problems on a Tree. |
Annals OR |
2002 |
DBLP DOI BibTeX RDF |
location, traveling salesman problem, polynomial algorithm |
| 1 | Igor Averbakh |
Minmax regret solutions for minimax optimization problems with uncertainty. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Algorithms for the robust 1-center problem on a tree. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Minmax Regret Median Location on a Network Under Uncertainty. |
INFORMS Journal on Computing |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Algorithms for path medi-centers of a tree. |
Computers & OR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Parallel Complexity of Additive Location Problems. |
INFORMS Journal on Computing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Location problems with grouped structure of demand: Complexity and algorithms. |
Networks |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. |
Transportation Science |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Routing Two-Machine Flowshop Problems on Networks with Special Structure. |
Transportation Science |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman |
Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints. |
INFORMS Journal on Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Oded Berman, Abraham P. Punnen |
Constrained Matroidal Bottleneck Problems. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh |
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. |
Math. Program. |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")