A Direct Search Method to Locate Negative Cycles in a Graph

DOI10.1287/MNSC.17.5.307zbMath0224.90047OpenAlexW2157129925MaRDI QIDQ5630837

P. Trepant, Michael Florian, Graham B. McMahon

Publication date: 1971

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.17.5.307

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (8)

Surrogate duality relaxation for job shop scheduling ⋮ Fuzzy job-shop scheduling problems: a review ⋮ One-machine rescheduling heuristics with efficiency and stability as criteria ⋮ A unified formulation of the machine scheduling problem ⋮ Insertion techniques for the heuristic solution of the job shop problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Job-shop scheduling with resource-time models of operations

This page was built for publication: A Direct Search Method to Locate Negative Cycles in a Graph