Small-m method for detecting all longest paths

DOI10.1007/S12597-019-00385-0MaRDI QIDQ2329560zbMATH OpenOpenAlexFDO

Authors Hiroyuki Goto, Alan T. Murray

Publication date 18 October 2019

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-019-00385-0

zbMATH Keywords

constraint satisfactionmixed integer linear programmingall longest pathscritical chain project management

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• Fuzzy longest path problem for project scheduling
• scientific article; zbMATH DE number 3948312
• Critical path in an activity network with time constraints
• A solution approach to find the critical path in a time-constrained activity network
• The Most Critical Path in a PERT Network

Cites work

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
• All pairs shortest paths for graphs with small integer length edges
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
• Finding the k Shortest Paths
• Integer programming formulations for the elementary shortest path problem
• More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

Cited in

(1)

• Exact and flexible solution approach to a critical chain project management problem

This page was built for publication: Small-\(m\) method for detecting all longest paths

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