Pages that link to "Item:Q4170233"
From MaRDI portal
The following pages link to Combinatorial Problems: Reductibility and Approximation (Q4170233):
Displaying 7 items.
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- The edge Hamiltonian path problem is NP-complete (Q1169818) (← links)
- Solving certain singly constrained convex optimization problems in production planning (Q1170996) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
