Integer Programming Formulation of Traveling Salesman Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A framework for multi-robot node coverage in sensor networks
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- An optimization-based heuristic for the robotic cell problem
- Methods for routing with time windows
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The pickup and delivery problem with time windows
- An analytical comparison of different formulations of the travelling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- On symmetric subtour problems
- Integer programming formulation of combinatorial optimization problems
- An approach for solving a class of transportation scheduling problems
- Optimal multiple stage expansion of competence set
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- Scheduling electric vehicles and locating charging stations on a path
- A matheuristic approach to the orienteering problem with service time dependent profits
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Computational approaches for zero forcing and related problems
- The time constrained maximal covering salesman problem
- Evaluating the quality of online optimization algorithms by discrete event simulation
- The driver and vehicle routing problem
- Solving the bus evacuation problem and its variants
- Vehicle routing with probabilistic capacity constraints
- An exact algorithm for a vehicle-and-driver scheduling problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- An open source spreadsheet solver for vehicle routing problems
- Routing and scheduling decisions in the hierarchical hub location problem
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- Vehicle routing with backhauls: review and research perspectives
- Picker routing in rectangular mixed shelves warehouses
- Integer programming models and linearizations for the traveling car renter problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Formulations for the orienteering problem with additional constraints
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Modelling beneficiaries' choice in disaster relief logistics
- The selective traveling salesman problem with emission allocation rules
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Crane scheduling in railway yards: an analysis of computational complexity
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- A vehicle routing problem arising in unmanned aerial monitoring
- The green location-routing problem
- Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
- Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Reformulated acyclic partitioning for rail-rail containers transshipment
- A comparison of algorithms for finding an efficient theme park tour
- Bi-objective safe and resilient urban evacuation planning
- The traveling purchaser problem and its variants
- Integrated production and distribution scheduling with a perishable product
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- Ordered weighted average optimization in multiobjective spanning tree problem
- Clustering data that are graph connected
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- An exact and heuristic approach for the d-minimum branch vertices problem
- The traveling salesman problem with draft limits
- Heuristic approaches for the optimal wiring in large scale robotic skin design
- On the core of traveling salesman games
- Fleet assignment and routing with schedule synchronization constraints
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Integer linear programming formulation for vehicle routing problems
- Vehicle dispatching with time-dependent travel times
- Solving the shortest route cut and fill problem using simulated annealing
- Designing radio-mobile access networks based on synchronous digital hierarchy rings
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A compact model and tight bounds for a combined location-routing problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- A branch-and-cut algorithm for the Steiner tree problem with delays
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A lexicographical goal programming based decision support system for logistics of humanitarian aid
- A self-organizing neural network approach for the single AGV routing problem
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
- Models and linearizations for the Traveling Car Renter with passengers
- Mathematical formulations and improvements for the multi-depot open vehicle routing problem
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Planning a multi-sensors search for a moving target considering traveling costs
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- Outreach strategies for vaccine distribution: a multi-period stochastic modeling approach
- Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
- A branch-and-price procedure for clustering data that are graph connected
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- Routing for unmanned aerial vehicles: touring dimensional sets
- Reinforcement learning of simplex pivot rules: a proof of concept
This page was built for publication: Integer Programming Formulation of Traveling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3281501)
