The following pages link to Juan-José Salazar-González (Q319444):
Displaying 50 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Enhanced controlled tabular adjustment (Q336885) (← links)
- Single liner shipping service design (Q336948) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- A column generation approach for a school bus routing problem with resource constraints (Q340259) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Statistical confidentiality. Principles and practice. (Q610154) (← links)
- Comments on: Routing Problems with loading constraints (Q610994) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- A heuristic approach for the travelling purchaser problem (Q707139) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- A heuristic approach for the continuous error localization problem in data cleaning (Q868999) (← links)
- A branch-and-cut algorithm for the continuous error localization problem in data cleaning (Q875426) (← links)
- (Q959509) (redirect page) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- A new approach for data editing and imputation (Q999135) (← links)
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- (Q1102166) (redirect page) (← links)
- A multiple criteria approach to aggregate industrial capacity expansion (Q1102167) (← links)
- A comparison of two interactive MCDM procedures (Q1119482) (← links)
- Group decision processes: MOLP procedures facilitating group and individual decision orientations (Q1202279) (← links)
- (Q1304468) (redirect page) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- Mathematical models for applying cell suppression methodology in statistical data protection. (Q1420457) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
- The driver and vehicle routing problem (Q1651584) (← links)
- An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
- The connected facility location polytope (Q1686059) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- (Q1814815) (redirect page) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (Q1869690) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- An efficient multistart heuristic for the driver and vehicle routing problem (Q2108177) (← links)
