The following pages link to (Q3680289):
Displaying 13 items.
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- New results of ant algorithms for the linear ordering problem (Q2893627) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- Approximating Minimum Linear Ordering Problems (Q3167397) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- (Q4537753) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- (Q4993600) (← links)
- The Rankability of Data (Q5025777) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic (Q6102772) (← links)