A linear mixed integer programming model for \(N\)-vehicle exploration problem (Q259122): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5754462 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3640530 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Real-Time Algorithm Scheme for n-Vehicle Exploration Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3054107 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A cone constrained convex program: structure and algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization methods for mixed integer weakly concave programming problems / rank | |||
Normal rank | |||
Latest revision as of 14:23, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear mixed integer programming model for \(N\)-vehicle exploration problem |
scientific article |
Statements
A linear mixed integer programming model for \(N\)-vehicle exploration problem (English)
0 references
11 March 2016
0 references
linear mixed integer programming
0 references
\(N\)-vehicle exploration problem
0 references
NP-hard
0 references
0 references
