Pages that link to "Item:Q2851846"
From MaRDI portal
The following pages link to On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846):
Displaying 7 items.
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898793) (← links)