The following pages link to Juan-José Salazar-González (Q319444):
Displayed 42 items.
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection (Q2469234) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data (Q2583143) (← links)
- Selective routing problem with synchronization (Q2669549) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- The Balanced Minimum Evolution Problem (Q2815445) (← links)
- (Q2861498) (← links)
- (Q2861522) (← links)
- Laying Out Sparse Graphs with Provably Minimum Bandwidth (Q2890478) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Decorous Lower Bounds for Minimum Linear Arrangement (Q2899100) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem (Q3091494) (← links)
- The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic (Q3091523) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← links)
- (Q3347651) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← links)
- (Q4011527) (← links)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232) (← links)
- (Q4414640) (← links)
- Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
- (Q4461915) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- The ring/<i>κ</i>‐rings network design problem: Model and branch‐and‐cut algorithm (Q4642409) (← links)
- A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
- (Q4738646) (← links)
- The symmetric generalized traveling salesman polytope (Q4894874) (← links)
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (Q5191135) (← links)
- A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods (Q5322139) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (Q5434593) (← links)
- Tool switching problems in the context of overlay printing with multiple colours (Q6111513) (← links)
- Tool switching problems with tool order constraints (Q6202949) (← links)
- Topological protection from exceptional points in Weyl and nodal line semimetals (Q6282942) (← links)
- Designing optimal masks for a multi-object spectrometer (Q6357908) (← links)