The pairwise flowtime network construction problem

DOI10.1016/j.orl.2021.10.005OpenAlexW3211377203MaRDI QIDQ2670455

Igor Averbakh

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.09312

zbMATH Keywords

polynomial algorithmconnectivity restorationflowtime schedulingnetwork construction planning

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Tree optimization based heuristics and metaheuristics in network construction problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Complexity of Scheduling under Precedence Constraints
• Lateness Minimization in Pairwise Connectivity Restoration Problems
• Mining Coal or Finding Terrorists: The Expanding Search Paradigm

This page was built for publication: The pairwise flowtime network construction problem