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

DOI10.1051/RO/2016003zbMATH Open1358.90021OpenAlexW2560054735MaRDI QIDQ2969956FDOQ2969956

Authors: 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

Recommendations

• A float-path theory and its application to the time-cost tradeoff problem
• Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
• Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
• A universal sequence in the classical travel-time inversion problem
• scientific article; zbMATH DE number 1309686
• An approach to the shortest path problem with time-varying
• The time-dependent quickest path problem: properties and bounds
• scientific article
• On the structure of a class of time‐optimal trajectories

zbMATH Keywords

operations researchpathequipment replacement problemabnormal critical activityoptimum allocation problemtime float

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• On a routing problem
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
• Activity nets: A guided tour through some recent developments
• Title not available (Why is that?)
• Multiobjective shortest path problems with lexicographic goal-based preferences
• A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
• Title not available (Why is that?)
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• 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
• Comparing different metaheuristic approaches for the median path problem with bounded length
• Critical path in an activity network with time constraints
• Depth-based short-sighted stochastic shortest path problems
• The orderly colored longest path problem -- a survey of applications and new algorithms
• Exact algorithms for finding longest cycles in claw-free graphs
• Approximating the Longest Cycle Problem in Sparse Graphs
• Criticality analysis in activity-on-node networks with minimal time lags
• Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
• Computing latest starting times of activities in interval-valued networks with minimal time lags
• The probabilistic longest path problem
• The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
• A dynamic traveling salesman problem with stochastic arc costs
• Title not available (Why is that?)
• Enumerating \(K\) best paths in length order in DAGs
• Exact algorithms for the traveling salesman problem with draft limits
• On the complexity of shortest path problems on discounted cost graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969956)