Related references
Note: Only part of the references are listed.Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
Alice Paul et al.
MATHEMATICS OF OPERATIONS RESEARCH (2020)
Approximate solutions for expanding search games on general networks
Steve Alpern et al.
ANNALS OF OPERATIONS RESEARCH (2019)
The expanding search ratio of a graph
Spyros Angelopoulos et al.
DISCRETE APPLIED MATHEMATICS (2019)
Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
Lisa Hellerstein et al.
OPERATIONS RESEARCH (2019)
Scheduling Post-Disaster Repairs in Electricity Distribution Networks
Yushi Tan et al.
IEEE TRANSACTIONS ON POWER SYSTEMS (2019)
On Submodular Search and Machine Scheduling
Robbert J. Fokkink et al.
MATHEMATICS OF OPERATIONS RESEARCH (2019)
Multiple searchers searching for a randomly distributed immobile target on a unit network
Songtao Li et al.
NETWORKS (2018)
A branch-and-price algorithm for the Minimum Latency Problem
Teobaldo Bulhoes et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
Lateness Minimization in Pairwise Connectivity Restoration Problems
Igor Averbakh et al.
INFORMS JOURNAL ON COMPUTING (2018)
The density maximization problem in graphs
Mong-Jen Kao et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2013)
Mining Coal or Finding Terrorists: The Expanding Search Paradigm
Steve Alpern et al.
OPERATIONS RESEARCH (2013)
Emergency path restoration problems
Igor Averbakh
DISCRETE OPTIMIZATION (2012)
The flowtime network construction problem
Igor Averbakh et al.
IIE TRANSACTIONS (2012)
Approximating a class of combinatorial problems with rational objective function
Jose R. Correa et al.
MATHEMATICAL PROGRAMMING (2010)
A new formulation for the Traveling Deliveryman Problem
Isabel Mendez-Diaz et al.
DISCRETE APPLIED MATHEMATICS (2008)
A faster, better approximation algorithm for the minimum latency problem
Aaron Archer et al.
SIAM JOURNAL ON COMPUTING (2008)
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
Hoong Chuin Lau et al.
DISCRETE OPTIMIZATION (2006)
Single-machine scheduling with precedence constraints
JR Correa et al.
MATHEMATICS OF OPERATIONS RESEARCH (2005)
Approximating min sum set cover
U Feige et al.
ALGORITHMICA (2004)
Approximate local search in combinatorial optimization
JB Orlin et al.
SIAM JOURNAL ON COMPUTING (2004)
Approximation techniques for average completion time scheduling
C Chekuri et al.
SIAM JOURNAL ON COMPUTING (2001)
Share Paper
