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

DOI10.1051/RO/2016003MaRDI QIDQ2969956zbMATH OpenOpenAlexFDO

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

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)

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; zbMATH DE number 4014449
• On the structure of a class of time‐optimal trajectories

Cites work

• scientific article; zbMATH DE number 4172725 (Why is no real title available?)
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 3604646 (Why is no real title available?)
• A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
• A dynamic traveling salesman problem with stochastic arc costs
• A new formulation and approach for the black and white traveling salesman problem
• A note on two problems in connexion with graphs
• Activity nets: A guided tour through some recent developments
• Approximating the Longest Cycle Problem in Sparse Graphs
• 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
• Criticality analysis in activity-on-node networks with minimal time lags
• Depth-based short-sighted stochastic shortest path problems
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
• 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
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• Multiobjective shortest path problems with lexicographic goal-based preferences
• On a routing problem
• On the complexity of shortest path problems on discounted cost graphs
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
• Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
• The orderly colored longest path problem -- a survey of applications and new algorithms
• The probabilistic longest path problem

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)