The following pages link to Sebastián Urrutia (Q323272):
Displaying 41 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Sports scheduling search space connectivity: a riffle shuffle driven approach (Q335339) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- Combinatorial relaxation bounds and preprocessing for berth allocation problems (Q510943) (← links)
- Scheduling in sports: an annotated bibliography (Q733513) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
- One-sided weak dominance drawing (Q1711831) (← links)
- Organising metabolic networks: cycles in flux distributions (Q1720056) (← links)
- An ILS heuristic for the traveling tournament problem with predefined venues (Q1761896) (← links)
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling (Q2034794) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- Erratum to: ``Characterizing acyclic graphs by labeling edges'' (Q2341738) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- Characterizing acyclic graphs by labeling edges (Q2448884) (← links)
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem (Q2500541) (← links)
- Load-dependent speed optimization in maritime inventory routing (Q2664387) (← links)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
- A New Formulation for Spanning Trees (Q2840708) (← links)
- Discrete optimization methods to determine trajectories for Dubins' vehicles (Q2883544) (← links)
- New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
- An application of integer programming to playoff elimination in football championships (Q3410163) (← links)
- (Q3500162) (← links)
- A multi‐agent framework to build integer programming applications to playoff elimination in sports tournaments (Q4600631) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
- (Q5708522) (← links)
- Maritime inventory routing: recent trends and future directions (Q6056882) (← links)
- A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
- Gamma deployment problem in grids: hardness and new integer linear programming formulation (Q6069923) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
- Polynomial time algorithms for the token swapping problem on cographs (Q6127637) (← links)
- The nilcatenation problem and its application for detecting money laundering activities in cryptocurrency networks (Q6561612) (← links)
- Combinatorial models for scheduling sports tournaments (Q6604522) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
