Pages that link to "Item:Q4198337"
From MaRDI portal
The following pages link to Approximative Algorithms for Discrete Optimization Problems (Q4198337):
Displayed 13 items.
- Meaningfulness of conclusions from combinatorial optimization (Q750310) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- On an approximate computation of the height of the maximal upper zero of a monotone Boolean function (Q1177787) (← links)
- On the computational complexity of reliability redundancy allocation in a series system (Q1196218) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach (Q3217446) (← links)
- Rational solutions of the graphsack problem (Q3315278) (← links)