Theory and application of reciprocal transformation of “path problem” and “time float problem”

DOI10.1051/ro/2016003zbMath1358.90021OpenAlexW2560054735MaRDI QIDQ2969956

Zhi-xiong Su, Jian-xun Qi, Han-ying Wei

Publication date: 24 March 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2016003

zbMATH Keywords

path operations research equipment replacement problem abnormal critical activity optimum allocation problem time float

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A note on two problems in connexion with graphs
Multiobjective shortest path problems with lexicographic goal-based preferences
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
A new formulation and approach for the black and white traveling salesman problem
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
Depth-based short-sighted stochastic shortest path problems
A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
Comparing different metaheuristic approaches for the median path problem with bounded length
Computing latest starting times of activities in interval-valued networks with minimal time lags
Critical path in an activity network with time constraints
Activity nets: A guided tour through some recent developments
Enumerating \(K\) best paths in length order in DAGs
Exact algorithms for finding longest cycles in claw-free graphs
Exact algorithms for the traveling salesman problem with draft limits
PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
Approximating the Longest Cycle Problem in Sparse Graphs
On a routing problem
The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
The probabilistic longest path problem
On the Complexity of Shortest Path Problems on Discounted Cost Graphs
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
Criticality analysis in activity-on-node networks with minimal time lags

This page was built for publication: Theory and application of reciprocal transformation of “path problem” and “time float problem”