Pages that link to "Item:Q1365047"
From MaRDI portal
The following pages link to Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047):
Displaying 11 items.
- A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems (Q466000) (← links)
- Subclasses of solvable problems from classes of combinatorial optimization problems (Q1040379) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems (Q1333241) (← links)
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← links)
- Solvable cases of a new combinatorial problem of optimization (Q1974351) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
- On a special case of valve-placement problem (Q3984073) (← links)
- (Q4414639) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)