Bi-criteria path problem with minimum length and maximum survival probability

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

(2018) Nir Halman et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A general approximation method for bicriteria minimization problems

(2017) Pascal Halffmann et al.   THEORETICAL COMPUTER SCIENCE

Urban navigation beyond shortest route: The case of safe paths

(2016) Esther Galbrun et al.   INFORMATION SYSTEMS

Shortest-path queries in static networks

(2014) Christian Sommer   ACM COMPUTING SURVEYS

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs

(2014) Nir Halman et al.   SIAM JOURNAL ON DISCRETE MATHEMATICS

A bi-objective cyclist route choice model

(2012) Matthias Ehrgott et al.   TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE

A survey on multi-constrained optimal path computation: Exact and approximate algorithms

(2010) Rosario G. Garroppo et al.   Computer Networks

A bi-objective approach for shortest-path network interdiction

(2010) Claudio M. Rocco S. et al.   COMPUTERS & INDUSTRIAL ENGINEERING

“Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation

(2010) C.T. Ng et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

(2009) Nir Halman et al.   MATHEMATICS OF OPERATIONS RESEARCH

A comparison of solution strategies for biobjective shortest path problems

(2008) Andrea Raith et al.   COMPUTERS & OPERATIONS RESEARCH