A linear mixed integer programming model for \(N\)-vehicle exploration problem

DOI10.1007/s40305-015-0099-6zbMath1332.90179OpenAlexW2260480664MaRDI QIDQ259122

F. Blanchet-Sadri, M. Dambrine

Publication date: 11 March 2016

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-015-0099-6

zbMATH Keywords

NP-hard\(N\)-vehicle exploration problemlinear mixed integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Permutations, words, matrices (05A05)

Related Items (1)

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

Cites Work

• A cone constrained convex program: structure and algorithms
• Optimization methods for mixed integer weakly concave programming problems
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear mixed integer programming model for \(N\)-vehicle exploration problem