Network construction/restoration problems: cycles and complexity
From MaRDI portal
Recommendations
- Network construction problems with due dates
- Minimizing the makespan in multiserver network restoration problems
- Lateness minimization in pairwise connectivity restoration problems
- Emergency path restoration problems
- Tree optimization based heuristics and metaheuristics in network construction problems
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2086925 (Why is no real title available?)
- A General Framework for Approximating Min Sum Ordering Problems
- Approximating min sum set cover
- Computer-aided complexity classification of dial-a-ride problems
- Efficient recovery from power outage (extended abstract)
- Exact and Approximation Algorithms for the Expanding Search Problem
- Finding kth paths and p-centers by generating and searching good data structures
- Incremental network design with minimum spanning trees
- Incremental network design with shortest paths
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- Interdependent network restoration: on the value of information-sharing
- Lateness minimization in pairwise connectivity restoration problems
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear-time computability of combinatorial problems on series-parallel graphs
- Minimizing latency in post-disaster road clearance operations
- Mining coal or finding terrorists: the expanding search paradigm
- Network construction problems with due dates
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Optimizing winter road maintenance operations under real-time information
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Scheduling Tasks with AND/OR Precedence Constraints
- Scheduling with AND/OR Precedence Constraints
- Solution methodologies for debris removal in disaster response
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
- Special cases of traveling salesman and repairman problems with time windows
- Strategic network restoration
- Synchronized arc routing for snow plowing operations
- Telecommunication link restoration planning with multiple facility types
- The Delivery Man Problem and Cumulative Matroids
- The post-disaster debris clearance problem under incomplete information
- The traveling salesman problem and its variations
- Tree optimization based heuristics and metaheuristics in network construction problems
Cited in
(10)- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
- Minimizing the makespan in multiserver network restoration problems
- Emergency path restoration problems
- Lateness minimization in pairwise connectivity restoration problems
- Note on polynomial-time approximation schemes for integrated network design and scheduling problems
- Network construction problems with due dates
- Tree optimization based heuristics and metaheuristics in network construction problems
- Efficient recovery from power outage (extended abstract)
- The complexity of reconfiguring network models
This page was built for publication: Network construction/restoration problems: cycles and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168711)
