scientific article; zbMATH DE number 1471488

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(200006)47:4<287::AID-NAV2>3.0.CO;2-R" /><287::AID-NAV2>3.0.CO;2-R 10.1002/(SICI)1520-6750(200006)47:4<287::AID-NAV2>3.0.CO;2-RzbMath0968.90020MaRDI QIDQ4488781

Michel Gendreau, Isabelle Parent, Gilbert Laporte

Publication date: 9 July 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tabu searchgreedy searchflow interception problemascent search

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (11)

Flow intercepting facility location: Problems, models and heuristics ⋮ Locating sensors to observe network arc flows: exact and heuristic approaches ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ Location Science in Canada ⋮ Mitigating Interdiction Risk with Fortification ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem ⋮ A Lagrangian relaxation approach to large-scale flow interception problems ⋮ Models and algorithms for the screen line-based traffic-counting location problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Future paths for integer programming and links to artificial intelligence
• Optimal Location of Discretionary Service Facilities

This page was built for publication: