The following pages link to (Q5650510):
Displaying 13 items.
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
