The following pages link to José Pérez (Q188736):
Displaying 13 items.
- Equivalence properties of the Cremer \& Pople puckering coordinates for \(N\)-membered rings (Q424180) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- Multiple voting location problems (Q933517) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Relaxation of the Condorcet and Simpson conditions in voting location (Q1869503) (← links)
- The \(p\)-facility ordered median problem on networks (Q2568602) (← links)
- Full ordering Voronoi sets for bi-facility bicriterium (max, sum) location on networks (Q2704993) (← links)
- The tolerant Condorcet points (Q2708114) (← links)
- Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
- (Q4254943) (← links)
- A polynomial algorithm for thep-centdian problem on a tree (Q4540080) (← links)
- The generalized \(p\)-centdian on network (Q5937142) (← links)
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
