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

DOI10.1007/S40305-015-0099-6MaRDI QIDQ259122zbMATH OpenOpenAlexFDO

Authors Lili Wang, Bing-Ling She, Junfeng Liu, Jin-Chaun Cui

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

\(N\)-vehicle exploration problemlinear mixed integer programmingNP-hard

Mathematics Subject Classification ID

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

Recommendations

• A novel MILP model for \(N\)-vehicle exploration problem
• Multitask n-vehicle exploration problem: complexity and algorithm
• A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
• Efficient algorithm for a kind of exploration problem with \(N\) vehicles
• A kind of rollout algorithm for \(N\) vehicles exploration problem

Cites work

• scientific article; zbMATH DE number 5181725 (Why is no real title available?)
• A cone constrained convex program: structure and algorithms
• A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• Efficient algorithm for a kind of exploration problem with \(N\) vehicles
• Optimization methods for mixed integer weakly concave programming problems
• Real-Time Algorithm Scheme for n-Vehicle Exploration Problem

Cited in

(5)

• Multitask \(n\)-vehicle exploration problem: complexity and algorithm
• Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
• A novel MILP model for \(N\)-vehicle exploration problem
• Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
• A kind of \(\varepsilon\)-approximation algorithm for the exploration problem with \(N\) vehicles

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

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