Pages that link to "Item:Q3362088"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (Q3362088):
Displayed 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- The clustered orienteering problem (Q296772) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Optimal joint replenishment, delivery and inventory management policies for perishable products (Q337009) (← links)
- Multi-period vehicle routing problem with due dates (Q337604) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- A minimum spanning tree based heuristic for the travelling salesman tour (Q724377) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Multi-step methods for choosing the best set of variables in regression analysis (Q989838) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)