default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Averbakh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j67]Igor Averbakh, Wei Yu:
The probabilistic uncapacitated open vehicle routing location problem. Networks 82(1): 68-83 (2023)- 2022
- [j66]Tianyu Wang, Igor Averbakh
:
Network construction/restoration problems: cycles and complexity. J. Comb. Optim. 44(1): 51-73 (2022) - 2021
- [j65]Igor Averbakh, Jordi Pereira:
Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res. 128: 105190 (2021) - [j64]Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass:
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. Discret. Appl. Math. 300: 36-55 (2021) - [j63]Igor Averbakh:
The pairwise flowtime network construction problem. Oper. Res. Lett. 49(6): 902-907 (2021) - [i2]Igor Averbakh:
Minimizing the total weighted pairwise connection time in network construction problems. CoRR abs/2104.09312 (2021) - 2020
- [j62]Igor Averbakh, Wei Yu:
Multi-depot traveling salesmen location problems on networks with special structure. Ann. Oper. Res. 286(1): 635-648 (2020) - [i1]Igor Averbakh, Jordi Pereira:
Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems. CoRR abs/2007.03425 (2020)
2010 – 2019
- 2018
- [j61]Zhendong Shao, Igor Averbakh:
The L(j, k)-Edge-Labeling Problem on Graphs. Ars Comb. 137: 165-176 (2018) - [j60]Igor Averbakh, Oded Berman, Marina Leal:
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. Discret. Appl. Math. 239: 193-199 (2018) - [j59]Igor Averbakh, Jordi Pereira:
Lateness Minimization in Pairwise Connectivity Restoration Problems. INFORMS J. Comput. 30(3): 522-538 (2018) - 2017
- [j58]Zhendong Shao, Igor Averbakh, Roberto Solis-Oba:
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. Discret. Appl. Math. 221: 106-114 (2017) - [j57]Igor Averbakh:
Minimizing the makespan in multiserver network restoration problems. Networks 70(1): 60-68 (2017) - 2016
- [j56]Zhendong Shao, Igor Averbakh, Sandi Klavzar:
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. Comput. J. 59(1): 151-158 (2016) - 2015
- [j55]Igor Averbakh, Jordi Pereira:
Network construction problems with due dates. Eur. J. Oper. Res. 244(3): 715-729 (2015) - [j54]Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass:
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. Oper. Res. 63(2): 394-411 (2015) - 2014
- [j53]Mohammad Javad Feizollahi, Igor Averbakh:
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows. INFORMS J. Comput. 26(2): 321-335 (2014) - [j52]Mojtaba Araghi, Oded Berman, Igor Averbakh:
Minisum multipurpose trip location problem on trees. Networks 63(2): 154-159 (2014) - [j51]Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel:
Cooperative covering problems on networks. Networks 63(4): 334-349 (2014) - 2013
- [j50]Jordi Pereira, Igor Averbakh:
The Robust Set Covering Problem with interval data. Ann. Oper. Res. 207(1): 217-235 (2013) - [j49]Igor Averbakh, Mehmet Baysan:
Batching and delivery in semi-online distribution systems. Discret. Appl. Math. 161(1-2): 28-42 (2013) - [j48]Igor Averbakh, Mehmet Baysan:
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. Oper. Res. Lett. 41(6): 710-714 (2013) - 2012
- [j47]Igor Averbakh:
Emergency path restoration problems. Discret. Optim. 9(1): 58-64 (2012) - [j46]Igor Averbakh, Mehmet Baysan:
Semi-online two-level supply chain scheduling problems. J. Sched. 15(3): 381-390 (2012) - 2011
- [j45]Jordi Pereira, Igor Averbakh:
Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38(8): 1153-1163 (2011) - [j44]Igor Averbakh, Yun-Bin Zhao:
Robust univariate spline models for interpolating interval data. Oper. Res. Lett. 39(1): 62-66 (2011) - 2010
- [j43]Igor Averbakh:
Minmax regret bottleneck problems with solution-induced interval uncertainty structure. Discret. Optim. 7(3): 181-190 (2010) - [j42]Igor Averbakh:
On-line integrated production-distribution scheduling problems with capacitated deliveries. Eur. J. Oper. Res. 200(2): 377-384 (2010) - [j41]Igor Averbakh:
Nash equilibria in competitive project scheduling. Eur. J. Oper. Res. 205(3): 552-556 (2010)
2000 – 2009
- 2009
- [j40]Igor Averbakh, Yun-Bin Zhao:
Relaxed robust second-order-cone programming. Appl. Math. Comput. 210(2): 387-397 (2009) - 2008
- [j39]Igor Averbakh, Yun-Bin Zhao:
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets. SIAM J. Optim. 18(4): 1436-1466 (2008) - 2007
- [j38]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. Eur. J. Oper. Res. 179(3): 956-967 (2007) - [j37]Igor Averbakh, Zhihui Xue:
On-line supply chain scheduling problems with preemption. Eur. J. Oper. Res. 181(1): 500-504 (2007) - 2006
- [j36]Vasilij Lebedev, Igor Averbakh:
Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discret. Appl. Math. 154(15): 2167-2177 (2006) - [j35]Igor Averbakh:
The minmax regret permutation flow-shop problem with two jobs. Eur. J. Oper. Res. 169(3): 761-766 (2006) - [j34]Igor Averbakh, Oded Berman, Ilya Chernykh:
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173(2): 531-539 (2006) - [j33]Igor Averbakh, Vasilij Lebedev:
The competitive salesman problem on a network: a worst-case approach. Oper. Res. Lett. 34(2): 165-174 (2006) - 2005
- [j32]Igor Averbakh, Sergey Bereg:
Facility location problems with uncertainty on the plane. Discret. Optim. 2(1): 3-34 (2005) - [j31]Igor Averbakh:
Computing and minimizing the relative regret in combinatorial optimization with interval data. Discret. Optim. 2(4): 273-287 (2005) - [j30]Igor Averbakh, Vasilij Lebedev:
On the complexity of minmax regret linear programming. Eur. J. Oper. Res. 160(1): 227-231 (2005) - [j29]Igor Averbakh, Oded Berman, Ilya Chernykh:
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166(1): 3-24 (2005) - [j28]Igor Averbakh:
The Minmax Relative Regret Median Problem on Networks. INFORMS J. Comput. 17(4): 451-461 (2005) - [j27]Igor Averbakh, Oded Berman, Ilya Chernykh:
The m-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33(3): 263-266 (2005) - 2004
- [j26]Igor Averbakh, Vasilij Lebedev:
Interval data minmax regret network optimization problems. Discret. Appl. Math. 138(3): 289-301 (2004) - [j25]Igor Averbakh:
Minmax regret linear resource allocation problems. Oper. Res. Lett. 32(2): 174-180 (2004) - 2003
- [j24]Igor Averbakh:
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. Discret. Appl. Math. 127(3): 505-522 (2003) - [j23]Igor Averbakh, Oded Berman:
An improved algorithm for the minmax regret median problem on a tree. Networks 41(2): 97-103 (2003) - 2002
- [j22]Igor Averbakh, Oded Berman:
Minmax p-Traveling Salesmen Location Problems on a Tree. Ann. Oper. Res. 110(1-4): 55-68 (2002) - [j21]Igor Averbakh, Oded Berman:
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. Networks 40(1): 1-12 (2002) - 2001
- [j20]Igor Averbakh:
On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. 90(2): 263-272 (2001) - 2000
- [j19]Igor Averbakh, Oded Berman:
Algorithms for the robust 1-center problem on a tree. Eur. J. Oper. Res. 123(2): 292-302 (2000) - [j18]Igor Averbakh, Oded Berman:
Minmax Regret Median Location on a Network Under Uncertainty. INFORMS J. Comput. 12(2): 104-110 (2000) - [j17]Igor Averbakh:
Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27(2): 57-65 (2000)
1990 – 1999
- 1999
- [j16]Igor Averbakh, Oded Berman:
Algorithms for path medi-centers of a tree. Comput. Oper. Res. 26(14): 1395-1409 (1999) - [j15]Igor Averbakh, Oded Berman:
Parallel Complexity of Additive Location Problems. INFORMS J. Comput. 11(3): 292-298 (1999) - [j14]Igor Averbakh, Oded Berman:
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems. Oper. Res. 47(1): 165-170 (1999) - 1998
- [j13]Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky:
The plant location problem with demand-dependent setup costs and centralized allocation. Eur. J. Oper. Res. 111(3): 543-554 (1998) - [j12]Igor Averbakh, Oded Berman:
Location problems with grouped structure of demand: Complexity and algorithms. Networks 31(2): 81-92 (1998) - 1997
- [j11]Igor Averbakh, Oded Berman:
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. Discret. Appl. Math. 75(3): 201-216 (1997) - 1996
- [j10]Igor Averbakh, Oded Berman:
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. Discret. Appl. Math. 68(1-2): 17-32 (1996) - [j9]Igor Averbakh, Oded Berman:
Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints. INFORMS J. Comput. 8(4): 361-366 (1996) - [j8]Igor Averbakh, Oded Berman:
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. Transp. Sci. 30(3): 261-269 (1996) - [j7]Igor Averbakh, Oded Berman:
Routing Two-Machine Flowshop Problems on Networks with Special Structure. Transp. Sci. 30(4): 303-314 (1996) - 1995
- [j6]Igor Averbakh, Oded Berman, Abraham P. Punnen:
Constrained Matroidal Bottleneck Problems. Discret. Appl. Math. 63(3): 201-214 (1995) - [j5]Igor Averbakh, Oded Berman:
Sales-delivery man problems on treelike networks. Networks 25(2): 45-58 (1995) - [j4]Igor Averbakh, Oded Berman:
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. Transp. Sci. 29(2): 184-197 (1995) - 1994
- [j3]Igor Averbakh:
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. Math. Program. 65: 311-330 (1994) - [j2]Igor Averbakh, Oded Berman:
Categorized bottleneck-minisum path problems on networks. Oper. Res. Lett. 16(5): 291-297 (1994) - [j1]Igor Averbakh, Oded Berman:
Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path. Transp. Sci. 28(2): 162-166 (1994)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
