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 14 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← 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)
- The Bipartite QUBO (Q5050150) (← links)