A novel MILP model for \(N\)-vehicle exploration problem

DOI10.1007/s40305-019-00289-2zbMath1488.90060OpenAlexW2997015203MaRDI QIDQ2240108

Jin-Chuan Cui, Guo-Jun Zhang

Publication date: 5 November 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00289-2

zbMATH Keywords

cutting planeMILP\(N\)-vehicle exploration problem (NVEP)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear mixed integer programming model for \(N\)-vehicle exploration problem
• Multitask \(n\)-vehicle exploration problem: complexity and algorithm
• The one-machine sequencing problem
• A polynomial-time approximation scheme for the airplane refueling problem
• For the airplane refueling problem local precedence implies global precedence
• The local-global conjecture for scheduling with non-linear cost
• Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
• The Jeep Problem

This page was built for publication: A novel MILP model for \(N\)-vehicle exploration problem