Hybrid optimization methods for time-dependent sequencing problems (Q1751901): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2016.11.035
@@ Property / DOI: 10.1016/j.ejor.2016.11.035 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2016.11.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2551102339
@@ Property / OpenAlex ID: W2551102339 / rank @@
+Normal rank
@@ Property / cites work @@
+The time dependent traveling salesman problem: polyhedra and algorithm
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to single-machine scheduling problems.
+Normal rank
@@ Property / cites work @@
+An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Improved filtering for weighted circuit constraints
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with learning considerations
+Normal rank
@@ Property / cites work @@
+The minimum latency problem
@@ Property / cites work: The minimum latency problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multivalued Decision Diagrams for Sequencing Problems
+Normal rank
@@ Property / cites work @@
+In Pursuit of the Traveling Salesman
@@ Property / cites work: In Pursuit of the Traveling Salesman / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+The Delivery Man Problem and Cumulative Matroids
@@ Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank @@
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-dependent routing problems: a review
@@ Property / cites work: Time-dependent routing problems: a review / rank @@
+Normal rank
@@ Property / cites work @@
+Natural and extended formulations for the time-dependent traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Load-dependent and precedence-based models for pickup and delivery problems
+Normal rank
@@ Property / cites work @@
+A classification of formulations for the (time-dependent) traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The delivery man problem with time windows
@@ Property / cites work: The delivery man problem with time windows / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Integrated methods for optimization
@@ Property / cites work: Integrated methods for optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Machine scheduling problems with a position-dependent deterioration
+Normal rank
@@ Property / cites work @@
+Makespan minimization in single-machine scheduling with step-deterioration of processing times
+Normal rank
@@ Property / cites work @@
+An Alternative Family of Transformations
@@ Property / cites work: An Alternative Family of Transformations / rank @@
+Normal rank
@@ Property / cites work @@
+Discrepancy-Based Additive Bounding Procedures
@@ Property / cites work: Discrepancy-Based Additive Bounding Procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Time‐dependent traveling salesman problem–the deliveryman case
+Normal rank
@@ Property / cites work @@
+Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
+Normal rank
@@ Property / cites work @@
+A new formulation for the traveling deliveryman problem
+Normal rank
@@ Property / cites work @@
+Facets and valid inequalities for the time-dependent travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An integer programming approach for the time-dependent TSP
+Normal rank
@@ Property / cites work @@
+The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Global Constraints: A Survey
@@ Property / cites work: Global Constraints: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling problems with position dependent job processing times: computational complexity results
+Normal rank
@@ Property / cites work @@
+New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
+Normal rank
@@ Property / cites work @@
+Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Some scheduling problems with general position-dependent and time-dependent learning effects
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2016.11.035
@@ Property / DOI: 10.1016/J.EJOR.2016.11.035 / rank @@
+Normal rank