Pages that link to "Item:Q1203065"
From MaRDI portal
The following pages link to Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065):
Displayed 6 items.
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
- \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)