A Dynamic Programming Approach to Sequencing Problems

Authors: Michael Held and Richard M. KarpAuthors Info & Affiliations

https://doi.org/10.1137/0110015

Get Access

BibTeX

Tools

Get full access to this article

View all available purchase options and get full access to this article.

Get Access

References

R. L. Ackoff, Progress in Operations Research, Vol. I, Publications in Operations Research, No. 5, John Wiley & Sons Inc., New York, 1961xii+505

Google Scholar

2A.

Richard Bellman, Combinatorial processes and dynamic programmingProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 217–249

Crossref

Google Scholar

2B.

Richard Bellman, Dynamic programming treatment of the travelling salesman problem, J. Assoc. Comput. Mach., 9 (1962), 61–63

Crossref

Web of Science

Google Scholar

G. A. Croes, A method for solving traveling-salesman problems, Operations Res., 6 (1958), 791–812

Crossref

Web of Science

Google Scholar

4A.

G. Dantzig, R. Fulkerson, S. Johnson, Solution of a large-scale traveling-salesman problem, J. Operations Res. Soc. Amer., 2 (1954), 393–410

Crossref

Web of Science

Google Scholar

4B.

G. B. Dantzig, D. R. Fulkerson, S. M. Johnson, On a linear-programming, combinatorial approach to the traveling-salesman problem, Operations Res., 7 (1959), 58–66

Crossref

Web of Science

Google Scholar

Kurt Eisemann, The trim problem, Management Sci., 3 (1957), 279–284

Crossref

Web of Science

Google Scholar

Merrill M. Flood, The traveling-salesman problem, Operations Res., 4 (1956), 61–75

Crossref

Web of Science

Google Scholar

P. C. Gilmore, R. E. Gomory, A linear programming approach to the cutting-stock problem, Operations Res., 9 (1961), 849–859

Crossref

Web of Science

Google Scholar

Maurice Kraitchik, Mathematical recreations, Dover Publications Inc., New York, N. Y., 1953, 330–, Chapter 11

Google Scholar

Robert McNaughton, Scheduling with deadlines and loss functions, Management Sci., 6 (1959/1960), 1–12

Crossref

Web of Science

Google Scholar

10.

M. E. Salveson, The assembly line balancing problem, Journal of Industrial Engineering, 6 (1955), 18–25

Google Scholar

11.

B. L. van der Waerden, Modern Algebra. Vol. I, Frederick Ungar Publishing Co., New York, N. Y., 1949xii+264

Google Scholar

Information & Authors

Information

Published In

Journal of the Society for Industrial and Applied Mathematics

Volume 10 • Issue 1 • March 1962

Pages: 196 - 210

DOI: 10.1137/0110015

Copyright

History

Submitted: 31 August 1961

Published online: 13 July 2006

Authors

Affiliations

Michael Held

View all articles by this author

Richard M. Karp

View all articles by this author

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

Discrete orca predation algorithm for the traveling salesman problem
Neural Computing and Applications, Vol. 36, No. 36 | 10 October 2024
Cross Ref
Traveling salesman problem with backend information processing
Operations Research Letters, Vol. 57 | 1 Nov 2024
Cross Ref
A preliminary assessment on the design of driverless demand-responsive transit regional systems: point-to-point vs. hub-and-spoke
Journal of Intelligent Transportation Systems | 31 October 2024
Cross Ref
Planning strategy based on visibility graph and traveling salesman problem with time window constraints
2024 28th International Conference on System Theory, Control and Computing (ICSTCC) | 10 Oct 2024
Cross Ref
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Discrete Applied Mathematics, Vol. 356 | 1 Oct 2024
Cross Ref
Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
Journal of Computational Science, Vol. 82 | 1 Oct 2024
Cross Ref
A Method for Generating Toolpaths in the Manufacturing of Orthosis Molds with a Five-Axis Computer Numerical Control Machine
Machines, Vol. 12, No. 10 | 20 October 2024
Cross Ref
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle
Algorithmica, Vol. 86, No. 9 | 12 June 2024
Cross Ref
Digital Quantum Simulation of Scalar Yukawa Coupling
Quantum Reports, Vol. 6, No. 3 | 18 July 2024
Cross Ref
Advanced Route Optimization using Hybrid Algorithms and Road-based Distance Calculation
IRO Journal on Sustainable Wireless Systems, Vol. 6, No. 3 | 1 September 2024
Cross Ref
Long directed detours: Reduction to 2-Disjoint Paths
Information Processing Letters, Vol. 186 | 1 Aug 2024
Cross Ref
Computer Vision-based road surveillance system using autonomous drones and sensor fusion
2024 27th International Conference on Information Fusion (FUSION) | 8 Jul 2024
Cross Ref
The simultaneous semi-random model for TSP
Mathematical Programming, Vol. 206, No. 1-2 | 11 August 2023
Cross Ref
Learning to guide local search optimisation for routing problems
Operations Research Letters, Vol. 55 | 1 Jul 2024
Cross Ref
Optimal Transportation Planning for a Do-It-Yourself Retailer with a Zone-Based Tariff
INFORMS Journal on Applied Analytics, Vol. 54, No. 4 | 1 Jul 2024
Cross Ref
Improved Discrete Fireworks Algorithm for Large Scale Knapsack Problem
2024 IEEE Congress on Evolutionary Computation (CEC) | 30 Jun 2024
Cross Ref
NeuralGLS: learning to guide local search with graph convolutional network for the traveling salesman problem
Neural Computing and Applications, Vol. 36, No. 17 | 10 October 2023
Cross Ref
Winning the race to customers with micro-fulfillment centers: an approach for network planning in quick commerce
Central European Journal of Operations Research, Vol. 32, No. 2 | 18 January 2024
Cross Ref
A unified pre-training and adaptation framework for combinatorial optimization on graphs
Science China Mathematics, Vol. 67, No. 6 | 7 February 2024
Cross Ref
Battery swapping, vehicle rebalancing, and staff routing for electric scooter sharing systems
Transportation Research Part E: Logistics and Transportation Review, Vol. 186 | 1 Jun 2024
Cross Ref
A Hierarchical Framework for Solving the Constrained Multiple Depot Traveling Salesman Problem
IEEE Robotics and Automation Letters, Vol. 9, No. 6 | 1 Jun 2024
Cross Ref
Machine Learning to Solve Vehicle Routing Problems: A Survey
IEEE Transactions on Intelligent Transportation Systems, Vol. 25, No. 6 | 1 Jun 2024
Cross Ref
Enhancing Single-Frame Supervision for Better Temporal Action Localization
IEEE Transactions on Visualization and Computer Graphics, Vol. 30, No. 6 | 1 Jun 2024
Cross Ref
Learning for Dynamic Subteaming and Voluntary Waiting in Heterogeneous Multi-Robot Collaborative Scheduling
2024 IEEE International Conference on Robotics and Automation (ICRA) | 13 May 2024
Cross Ref
Active Implicit Reconstruction Using One-Shot View Planning
2024 IEEE International Conference on Robotics and Automation (ICRA) | 13 May 2024
Cross Ref
GENERATING MAINTENANCE TABLE OF POWER STATIONS USING GENETIC ALGORITHM
مجلة العلوم والدراسات الإنسانية - كلية الآداب والعلوم – المرج, No. 10 | 5 May 2024
Cross Ref
The AddACO: A bio-inspired modified version of the ant colony optimization algorithm to solve travel salesman problems
Mathematics and Computers in Simulation, Vol. 218 | 1 Apr 2024
Cross Ref
Guided quantum walk
Physical Review Research, Vol. 6, No. 1 | 21 March 2024
Cross Ref
Ordering cross-spread gathers
GEOPHYSICS, Vol. 89, No. 2 | 15 February 2024
Cross Ref
Few hamiltonian cycles in graphs with one or two vertex degrees
Mathematics of Computation, Vol. 325 | 2 February 2024
Cross Ref
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals
Theoretical Computer Science, Vol. 986 | 1 Feb 2024
Cross Ref
Autonomous Aerial Search and Revisit Behavior for Communication Limited Environments
AIAA SCITECH 2024 Forum | 4 January 2024
Cross Ref
Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 25 May 2024
Cross Ref
Test-Time Augmentation for Traveling Salesperson Problem
Artificial Neural Networks and Machine Learning – ICANN 2024 | 17 September 2024
Cross Ref
Algorithms for Future Mobility Society
Advanced Mathematical Science for Mobility Society | 14 March 2024
Cross Ref
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
European Journal of Operational Research, Vol. 312, No. 2 | 1 Jan 2024
Cross Ref
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
International Journal of Networking and Computing, Vol. 14, No. 1 | 1 Jan 2024
Cross Ref
Traveling Salesman Problem
Encyclopedia of Optimization | 24 May 2024
Cross Ref
A Dynamic Programming with Cluster First - Route Second Approach for Solving Vehicle with Pickup and Delivery Problem in Retail Industry
2023 RIVF International Conference on Computing and Communication Technologies (RIVF) | 23 Dec 2023
Cross Ref
The single robot line coverage problem: Theory, algorithms, and experiments
Networks, Vol. 82, No. 4 | 25 July 2023
Cross Ref
Multiple ground/aerial parcel delivery problem: a Weighted Road Network Voronoi Diagram based approach
Distributed and Parallel Databases, Vol. 41, No. 4 | 12 July 2021
Cross Ref
Designing sustainable logistics networks for classified municipal solid wastes collection and transferring with multi-compartment vehicles
Sustainable Cities and Society, Vol. 99 | 1 Dec 2023
Cross Ref
A digital solution framework for enabling electric vehicle battery circularity based on an ecosystem value optimization approach
npj Materials Sustainability, Vol. 1, No. 1 | 12 October 2023
Cross Ref
A strategy based on Wave Swarm for the formation task inspired by the Traveling Salesman Problem
Engineering Applications of Artificial Intelligence, Vol. 126 | 1 Nov 2023
Cross Ref
A General Framework for Enumerating Equivalence Classes of Solutions
Algorithmica, Vol. 85, No. 10 | 4 May 2023
Cross Ref
Using an $$A^*$$-based framework for decomposing combinatorial optimization problems to employ NISQ computers
Quantum Information Processing, Vol. 22, No. 10 | 27 September 2023
Cross Ref
Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
2023 IEEE International Conference on Quantum Computing and Engineering (QCE) | 17 Sep 2023
Cross Ref
In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers’ walking effort
OR Spectrum, Vol. 45, No. 3 | 8 May 2023
Cross Ref
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm
European Journal of Operational Research, Vol. 309, No. 2 | 1 Sep 2023
Cross Ref
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
Journal of Computer and System Sciences, Vol. 136 | 1 Sep 2023
Cross Ref
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
INFORMS Journal on Computing, Vol. 35, No. 5 | 1 Sep 2023
Cross Ref
Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints
Bulletin of the Polytechnic Institute of Iași. Electrical Engineering, Power Engineering, Electronics Section, Vol. 69, No. 3 | 9 November 2024
Cross Ref
Planning Integrated Unmanned Aerial Vehicle and Conventional Vehicle Delivery Operations under Restricted Airspace: A Mixed Nested Genetic Algorithm and Geographic Information System-Assisted Optimization Approach
Vehicles, Vol. 5, No. 3 | 2 September 2023
Cross Ref
A bi-criteria moving-target travelling salesman problem under uncertainty
European Journal of Operational Research, Vol. 309, No. 1 | 1 Aug 2023
Cross Ref
Parameterised temporal exploration problems
Journal of Computer and System Sciences, Vol. 135 | 1 Aug 2023
Cross Ref
Traveling Salesman Problem with Ant Colony Optimization
2023 2nd International Conference on Edge Computing and Applications (ICECAA) | 19 Jul 2023
Cross Ref
Optimization of a High Storage System with two Cranes per Aisle
2023 IEEE 21st International Conference on Industrial Informatics (INDIN) | 18 Jul 2023
Cross Ref
Efficient Production Scheduling by Exploiting Repetitive Product Configurations
2023 IEEE 21st International Conference on Industrial Informatics (INDIN) | 18 Jul 2023
Cross Ref
FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals
2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS) | 1 Jul 2023
Cross Ref
Algorithmic Applications of Hypergraph and Partition Containers
Proceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
Cross Ref
A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
Journal of Scheduling, Vol. 26, No. 3 | 6 October 2022
Cross Ref
Energy minimizing order picker forklift routing problem
European Journal of Operational Research, Vol. 307, No. 2 | 1 Jun 2023
Cross Ref
Sign depth tests in multiple regression
Journal of Statistical Computation and Simulation, Vol. 93, No. 7 | 10 October 2022
Cross Ref
Discrete komodo algorithm for traveling salesman problem
Applied Soft Computing, Vol. 139 | 1 May 2023
Cross Ref
An Adaptive Hybrid Quantum Algorithm for the Metric Traveling Salesman Problem
2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2023
Cross Ref
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP *
2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) | 1 May 2023
Cross Ref
Opportunities for Quantum Acceleration of Databases: Optimization of Queries and Transaction Schedules
Proceedings of the VLDB Endowment, Vol. 16, No. 9 | 10 July 2023
Cross Ref
An Integer Programming Based Approach to Delivery Drone Routing under Load-Dependent Flight Speed
Drones, Vol. 7, No. 5 | 16 May 2023
Cross Ref
Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity
IEEE Robotics and Automation Letters, Vol. 8, No. 4 | 1 Apr 2023
Cross Ref
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
Annals of Operations Research, Vol. 322, No. 1 | 8 August 2022
Cross Ref
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
European Journal of Operational Research, Vol. 305, No. 3 | 1 Mar 2023
Cross Ref
A Flow-Based Formulation of the Travelling Salesman Problem with Penalties on Nodes
Sustainability, Vol. 15, No. 5 | 28 February 2023
Cross Ref
Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version
Computers & Operations Research, Vol. 150 | 1 Feb 2023
Cross Ref
Analytics and machine learning in vehicle routing research
International Journal of Production Research, Vol. 61, No. 1 | 24 December 2021
Cross Ref
Basics
Tropical Circuit Complexity | 11 August 2023
Cross Ref
Rectangle Bounds
Tropical Circuit Complexity | 11 August 2023
Cross Ref
Additive Routing Problem for a System of High-Priority Tasks
Mathematical Optimization Theory and Operations Research: Recent Trends | 21 September 2023
Cross Ref
Repositioning Fleet Vehicles: A Learning Pipeline
Learning and Intelligent Optimization | 25 October 2023
Cross Ref
Measuring Machine Intelligence Using Black-Box-Based Universal Intelligence Metrics
New Approaches for Multidimensional Signal Processing | 3 December 2022
Cross Ref
On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", Vol. 16, No. 3 | 1 Jan 2023
Cross Ref
A 3/2-Approximation for the Metric Many-Visits Path TSP
- Kristóf Bérczi,
- Matthias Mnich, and
- Roland Vincze
SIAM Journal on Discrete Mathematics, Vol. 36, No. 4 | 8 December 2022
Abstract PDF (767 KB)
Collaborative optimization by shared objective function data
Array, Vol. 16 | 1 Dec 2022
Cross Ref
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
Journal of Combinatorial Optimization, Vol. 44, No. 4 | 17 June 2020
Cross Ref
Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles
Energies, Vol. 15, No. 21 | 3 November 2022
Cross Ref
Solving the Hamilton cycle problem fast on average
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
Cross Ref
Methodological Concepts: Algorithmic Solutions of Bioinformatics Problems
From Sequences to Graphs | 9 September 2022
Cross Ref
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
Algorithmica, Vol. 84, No. 9 | 20 May 2022
Cross Ref
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
Optimization Letters, Vol. 16, No. 7 | 16 June 2021
Cross Ref
The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No
SN Computer Science, Vol. 3, No. 5 | 15 July 2022
Cross Ref
On the analysis of optimization problems in arc-dependent networks
Discrete Optimization, Vol. 45 | 1 Aug 2022
Cross Ref
Hierarchical Multiobjective Heuristic for PCB Assembly Optimization in a Beam-Head Surface Mounter
IEEE Transactions on Cybernetics, Vol. 52, No. 7 | 1 Jul 2022
Cross Ref
The Probabilistic Travelling Salesman Problem with Crowdsourcing
Computers & Operations Research, Vol. 142 | 1 Jun 2022
Cross Ref
Exact algorithms for the min-max cycle cover problem
SCIENTIA SINICA Informationis, Vol. 52, No. 6 | 8 June 2022
Cross Ref
The traveling salesman problem of route optimization: a study on tourists' travel plan through Guangzhou subway networks
2nd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2022) | 17 May 2022
Cross Ref
Sparktope: linear programs from algorithms
Optimization Methods and Software, Vol. 37, No. 3 | 6 January 2021
Cross Ref
A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem
Neural Computing and Applications, Vol. 34, No. 10 | 9 January 2022
Cross Ref
Integrated photonic traveling salesman problem probabilistic solver with polynomial calculation time complexity
Japanese Journal of Applied Physics, Vol. 61, No. 5 | 9 May 2022
Cross Ref
SCVP: Learning One-Shot View Planning via Set Covering for Unknown Object Reconstruction
IEEE Robotics and Automation Letters, Vol. 7, No. 2 | 1 Apr 2022
Cross Ref
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
OR Spectrum, Vol. 44, No. 1 | 5 November 2021
Cross Ref
Disentangling relationships in symptom networks using matrix permutation methods
Psychometrika, Vol. 87, No. 1 | 19 July 2021
Cross Ref
Dynamic Programming algorithms and their applications in machine scheduling: A review
Expert Systems with Applications, Vol. 190 | 1 Mar 2022
Cross Ref
Multi-objective Branch and Bound based on Decomposition
IEEJ Transactions on Electronics, Information and Systems, Vol. 142, No. 3 | 1 Mar 2022
Cross Ref
Logistics planning of cash transfer to Syrian refugees in Turkey
European Journal of Operational Research, Vol. 296, No. 3 | 1 Feb 2022
Cross Ref
Load and Wind Aware Routing of Delivery Drones
Drones, Vol. 6, No. 2 | 17 February 2022
Cross Ref
Quantum algorithm for the shortest superstring problem
International Conference on Micro- and Nano-Electronics 2021 | 31 Jan 2022
Cross Ref
Methodology of Solving Selected Routing Problems
Graph-Based Modelling in Science, Technology and Art | 2 August 2021
Cross Ref
On the Routing of Unmanned Aerial Vehicles (UAVs) in Precision Farming Sampling Missions
Information and Communication Technologies for Agriculture—Theme III: Decision | 28 April 2022
Cross Ref
A Fair-Cost Analysis of the Random Neighbor Sampling Method
Complex Networks & Their Applications X | 1 January 2022
Cross Ref
The Simultaneous Semi-random Model for TSP
Integer Programming and Combinatorial Optimization | 27 May 2022
Cross Ref
Deep Policy Dynamic Programming for Vehicle Routing Problems
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 10 June 2022
Cross Ref
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Theory and Applications of Models of Computation | 1 January 2023
Cross Ref
The Polynomial Randomized Algorithm to Compute Bounded Degree Graph for TSP Based on Frequency Quadrilaterals
Theoretical Computer Science | 10 December 2022
Cross Ref
Which rectangle sets have perfect packings?
Operations Research Perspectives, Vol. 9 | 1 Jan 2022
Cross Ref
To the application of two-stage dynamic programming in the problem of sequential visiting of megalopolises
Procedia Structural Integrity, Vol. 40 | 1 Jan 2022
Cross Ref
Disjoint paths and connected subgraphs for H-free graphs
Theoretical Computer Science, Vol. 898 | 1 Jan 2022
Cross Ref
Reinforcement Learning-Based Collision Avoidance and Optimal Trajectory Planning in UAV Communication Networks
IEEE Transactions on Mobile Computing, Vol. 21, No. 1 | 1 Jan 2022
Cross Ref
ECoalVis: Visual Analysis of Control Strategies in Coal-fired Power Plants
IEEE Transactions on Visualization and Computer Graphics, Vol. 26 | 1 Jan 2022
Cross Ref
Reciprocal inputs in arithmetic and tropical circuits
Mathematical Problems of Cybernetics, No. 20 | 1 January 2022
Cross Ref
Traveling Salesman Problem with Path Flexibility Under Wireless Charging Lanes
SSRN Electronic Journal, Vol. 52 | 1 Jan 2022
Cross Ref
Multicriteria decision-making method for scheduling problem based on smart batches and their quality prediction capability
Computers in Industry, Vol. 133 | 1 Dec 2021
Cross Ref
Efficiency of cluster schemes implementation for discrete dynamic programming for systems of support of dispatching technological processes in transport systems
Journal of Physics: Conference Series, Vol. 2131, No. 3 | 1 Dec 2021
Cross Ref
On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
Proceedings of the Steklov Institute of Mathematics, Vol. 315, No. S1 | 20 January 2022
Cross Ref
RLC: A Reinforcement Learning-Based Charging Algorithm for Mobile Devices
ACM Transactions on Sensor Networks, Vol. 17, No. 4 | 16 July 2021
Cross Ref
Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
International Journal of Computers and Communications, Vol. 15 | 25 November 2021
Cross Ref
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Optimization Methods and Software, Vol. 36, No. 6 | 14 September 2020
Cross Ref
Secrecy Rate of Resource-Constrained Mobile Relay Model under Two-Way Wiretap Channel
Applied Sciences, Vol. 11, No. 21 | 22 October 2021
Cross Ref
Reinforcement learning for combinatorial optimization: A survey
Computers & Operations Research, Vol. 134 | 1 Oct 2021
Cross Ref
A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem
Algorithms, Vol. 14, No. 9 | 14 September 2021
Cross Ref
Ant colony optimization for traveling salesman problem based on parameters optimization
Applied Soft Computing, Vol. 107 | 1 Aug 2021
Cross Ref
A Heuristic Algorithm to Compute a Subgraph for TSP Based on Frequency Quadrilaterals
Journal of Physics: Conference Series, Vol. 1995, No. 1 | 1 Aug 2021
Cross Ref
Approximation of the Double Traveling Salesman Problem with Multiple Stacks
Theoretical Computer Science, Vol. 877 | 1 Jul 2021
Cross Ref
On the Solution of the Travelling Salesman Problem for Nonlinear Salesman Dynamics using Symbolic Optimal Control
2021 European Control Conference (ECC) | 29 Jun 2021
Cross Ref
An efficient framework for data aggregation in smart agriculture
Concurrency and Computation: Practice and Experience, Vol. 33, No. 10 | 26 December 2020
Cross Ref
Optimal routing in a problem with constraints and cost functions depending on the task list
Journal of Physics: Conference Series, Vol. 1864, No. 1 | 1 May 2021
Cross Ref
A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems
Journal of Heuristics, Vol. 27, No. 1-2 | 29 March 2021
Cross Ref
A new split-based hybrid metaheuristic for the reconfigurable transfer line balancing problem
International Journal of Production Research, Vol. 59, No. 4 | 4 February 2020
Cross Ref
Toward practical algorithms for activity chain optimization
Transportation Letters, Vol. 13, No. 1 | 14 December 2019
Cross Ref
Traveling Salesman Problem in a Geographic Information Management System
Progress in Industrial Mathematics: Success Stories | 21 December 2020
Cross Ref
Disjoint Paths and Connected Subgraphs for H-Free Graphs
Combinatorial Algorithms | 30 June 2021
Cross Ref
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
Fundamentals of Computation Theory | 9 September 2021
Cross Ref
Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
Optimization and Applications | 5 November 2021
Cross Ref
A Dynamic Programming Algorithm for Energy-Aware Routing of Delivery Drones
Advances in Artificial Intelligence and Data Engineering | 14 August 2020
Cross Ref
The Distribution of Edge-Frequencies Computed with Frequency Quadrilaterals for Traveling Salesman Problem
Theoretical Computer Science | 10 November 2021
Cross Ref
Parallel Antlion Optimisation (ALO) and Grasshopper Optimization (GOA) for Travelling Salesman Problem (TSP)
Innovations in Computer Science and Engineering | 24 April 2021
Cross Ref
Multiple Resource Network Voronoi Diagram
IEEE Transactions on Knowledge and Data Engineering, Vol. 42 | 1 Jan 2021
Cross Ref
Energy-aware Routing of Delivery Drones under Windy Conditions
IPSJ Transactions on System and LSI Design Methodology, Vol. 14, No. 0 | 1 Jan 2021
Cross Ref
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, Vol. 14, No. 1 | 12 January 2021
Cross Ref
Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
Numerical Algebra, Control & Optimization, Vol. 11, No. 2 | 1 Jan 2021
Cross Ref
An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic
Applied Artificial Intelligence, Vol. 34, No. 14 | 4 October 2020
Cross Ref
A periodic optimization approach to dynamic pickup and delivery problems with time windows
Journal of Scheduling, Vol. 23, No. 6 | 23 June 2020
Cross Ref
A microplanning model to improve door-to-door health service delivery: the case of Seasonal Malaria Chemoprevention in Sub-Saharan African villages
BMC Health Services Research, Vol. 20, No. 1 | 7 December 2020
Cross Ref
Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions
Computers & Operations Research, Vol. 123 | 1 Nov 2020
Cross Ref
References
Integer Programming | 19 September 2020
Cross Ref
On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours
Transportation Research Part E: Logistics and Transportation Review, Vol. 142 | 1 Oct 2020
Cross Ref
Application of Modified Flower Pollination Algorithm to Multiple Vehicle Routing Problems with Time Constraints
WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL, Vol. 15 | 28 September 2020
Cross Ref
Coarse Trajectory Design for Energy Minimization in UAV-Enabled
IEEE Transactions on Vehicular Technology, Vol. 69, No. 9 | 1 Sep 2020
Cross Ref
Solving Multiple Vehicle Routing Problems with Time Constraintsby Flower Pollination Algorithm Optimization
WSEAS TRANSACTIONS ON SYSTEMS, Vol. 19 | 24 August 2020
Cross Ref
Finding a Hamilton cycle fast on average using rotations and extensions
Random Structures & Algorithms, Vol. 57, No. 1 | 16 March 2020
Cross Ref
Time- and Space-optimal Algorithm for the Many-visits TSP
ACM Transactions on Algorithms, Vol. 16, No. 3 | 6 June 2020
Cross Ref
Spectral Lower Bounds on the I/O Complexity of Computation Graphs
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures | 9 July 2020
Cross Ref
OP-MR: the implementation of order picking based on mixed reality in a smart warehouse
The Visual Computer, Vol. 36, No. 7 | 18 September 2019
Cross Ref
A two-stage multi-operator differential evolution algorithm for solving Resource Constrained Project Scheduling problems
Future Generation Computer Systems, Vol. 108 | 1 Jul 2020
Cross Ref
Sorting can exponentially speed up pure dynamic programming
Information Processing Letters, Vol. 159-160 | 1 Jul 2020
Cross Ref
Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem
2020 American Control Conference (ACC) | 1 Jul 2020
Cross Ref
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 22 June 2020
Cross Ref
Complex Vehicle Routing with Memory Augmented Neural Networks
2020 IEEE Conference on Industrial Cyberphysical Systems (ICPS) | 10 Jun 2020
Cross Ref
Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines
OR Spectrum, Vol. 42, No. 2 | 3 May 2020
Cross Ref
CAAS: a novel collective action-based ant system algorithm for solving TSP problem
Soft Computing, Vol. 24, No. 12 | 11 November 2019
Cross Ref
A mathematical model for supply chain management of blood banks in India
OPSEARCH, Vol. 57, No. 2 | 18 November 2019
Cross Ref
Amoeba-inspired combinatorial optimization machines
Japanese Journal of Applied Physics, Vol. 59, No. 6 | 12 May 2020
Cross Ref
Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic
International Journal of Production Research, Vol. 58, No. 9 | 24 June 2019
Cross Ref
Topological background discrimination in the PandaX-III neutrinoless double beta decay experiment
Journal of Physics G: Nuclear and Particle Physics, Vol. 47, No. 4 | 27 February 2020
Cross Ref
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor
IEEE Robotics and Automation Letters, Vol. 5, No. 2 | 1 Apr 2020
Cross Ref
Approximation Limitations of Pure Dynamic Programming
- Stasys Jukna and
- Hannes Seiwert
SIAM Journal on Computing, Vol. 49, No. 1 | 18 February 2020
Abstract PDF (676 KB)
Edges Elimination for Traveling Salesman Problem Based on Frequency $$K_5$$ s
Optimization of Complex Systems: Theory, Models, Algorithms and Applications | 15 June 2019
Cross Ref
On Finding Shortest Paths in Arc-Dependent Networks
Combinatorial Optimization | 22 July 2020
Cross Ref
The Frequency of the Optimal Hamiltonian Cycle Computed with Frequency Quadrilaterals for Traveling Salesman Problem
Algorithmic Aspects in Information and Management | 9 August 2020
Cross Ref
Quantum Speedup for the Minimum Steiner Tree Problem
Computing and Combinatorics | 27 August 2020
Cross Ref
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints
Algorithms for Sensor Systems | 28 October 2020
Cross Ref
On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art
Smart Delivery Systems | 1 Jan 2020
Cross Ref
On the fastest finite Markov processes
Journal of Mathematical Analysis and Applications, Vol. 481, No. 2 | 1 Jan 2020
Cross Ref
Where the really hard problems aren’t
Operations Research Perspectives, Vol. 7 | 1 Jan 2020
Cross Ref
Dynamic programming in routing problems (nuclear power, Engineering)
1 Jan 2020
Cross Ref
Identification of the most efficient algorithm to find Hamiltonian Path in practical conditions
2020 10th International Conference on Cloud Computing, Data Science & Engineering (Confluence) | 1 Jan 2020
Cross Ref
On One Routing Problem with Non-Additive Cost Aggregation
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", Vol. 13, No. 1 | 1 Jan 2020
Cross Ref
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
ACM Journal of Experimental Algorithmics, Vol. 24 | 10 December 2019
Cross Ref
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Journal of Scheduling, Vol. 22, No. 6 | 14 August 2019
Cross Ref
Deskilling Robots in Logistics Environments
KI - Künstliche Intelligenz, Vol. 33, No. 4 | 26 September 2019
Cross Ref
Work-in-Progress: Routing of Delivery Drones with Load-Dependent Flight Speed
2019 IEEE Real-Time Systems Symposium (RTSS) | 1 Dec 2019
Cross Ref
An Improved Ant Colony Optimization Algorithm Based on Fractional Order Memory for Traveling Salesman Problems
2019 IEEE Symposium Series on Computational Intelligence (SSCI) | 1 Dec 2019
Cross Ref
Accelerating the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem
IEICE Transactions on Information and Systems, Vol. E102.D, No. 12 | 1 Dec 2019
Cross Ref
Select and permute: An improved online framework for scheduling to minimize weighted completion time
Theoretical Computer Science, Vol. 795 | 1 Nov 2019
Cross Ref
A cumulative service state representation for the pickup and delivery problem with transfers
Transportation Research Part B: Methodological, Vol. 129 | 1 Nov 2019
Cross Ref
A Web-Based Routing and Visualization Tool for Drone Delivery
2019 Seventh International Symposium on Computing and Networking Workshops (CANDARW) | 1 Nov 2019
Cross Ref
On Submodular Search and Machine Scheduling
Mathematics of Operations Research, Vol. 44, No. 4 | 1 Nov 2019
Cross Ref
Improving TSP Tours Using Dynamic Programming over Tree Decompositions
ACM Transactions on Algorithms, Vol. 15, No. 4 | 4 October 2019
Cross Ref
Path Planning Optimization with Flexible Remote Sensing Application
Path Planning for Autonomous Vehicles - Ensuring Reliable Driverless Navigation and Control Maneuver | 2 October 2019
Cross Ref
Traveling in randomly embedded random graphs
Random Structures & Algorithms, Vol. 55, No. 3 | 14 December 2018
Cross Ref
A Case Study of Route Optimisation for Phuket Healthy Drink Delivery System
2019 23rd International Computer Science and Engineering Conference (ICSEC) | 1 Oct 2019
Cross Ref
Discrete Gravitational Search Algorithm (DGSA) applied for the Close-Enough Travelling Salesman Problem (TSP / CETSP)
2019 International Semiconductor Conference (CAS) | 1 Oct 2019
Cross Ref
Frequency Graphs for Travelling Salesman Problem Based on Ant Colony Optimization
International Journal of Computational Intelligence and Applications, Vol. 18, No. 03 | 29 September 2019
Cross Ref
Runtime analysis of discrete particle swarm optimization algorithms: A survey
it - Information Technology, Vol. 61, No. 4 | 24 October 2019
Cross Ref
References
Fundamentals of Supply Chain Theory | 28 June 2019
Cross Ref
Domino sequencing: Scheduling with state-based sequence-dependent setup times
Operations Research Letters, Vol. 47, No. 4 | 1 Jul 2019
Cross Ref
On the Complexity Landscape of Connected f-Factor Problems
Algorithmica, Vol. 81, No. 6 | 30 January 2019
Cross Ref
Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
Central European Journal of Operations Research, Vol. 27, No. 2 | 18 July 2018
Cross Ref
Manual order consolidation with put walls: the batched order bin sequencing problem
EURO Journal on Transportation and Logistics, Vol. 8, No. 2 | 1 Jun 2019
Cross Ref
A VLOS Compliance Solution to Ground/Aerial Parcel Delivery Problem
2019 20th IEEE International Conference on Mobile Data Management (MDM) | 1 Jun 2019
Cross Ref
Time Optimal Tour Through a Class of Points for a Double Integrator Traveling Salesman
2019 18th European Control Conference (ECC) | 1 Jun 2019
Cross Ref
Sufficient and Necessary Conditions for an Edge in the Optimal Hamiltonian Cycle Based on Frequency Quadrilaterals
Journal of Optimization Theory and Applications, Vol. 181, No. 2 | 7 January 2019
Cross Ref
Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem
Computers & Industrial Engineering, Vol. 131 | 1 May 2019
Cross Ref
New heuristic algorithm for traveling salesman problem
Journal of Physics: Conference Series, Vol. 1218, No. 1 | 1 May 2019
Cross Ref
Joint Communication and Motion Energy Minimization in UGV Backscatter Communication
ICC 2019 - 2019 IEEE International Conference on Communications (ICC) | 1 May 2019
Cross Ref
Backscatter Data Collection With Unmanned Ground Vehicle: Mobility Management and Power Allocation
IEEE Transactions on Wireless Communications, Vol. 18, No. 4 | 1 Apr 2019
Cross Ref
Realization Energy Optimization of Complete Path Planning in Differential Drive Based Self-Reconfigurable Floor Cleaning Robot
Energies, Vol. 12, No. 6 | 23 March 2019
Cross Ref
Greedy can beat pure dynamic programming
Information Processing Letters, Vol. 142 | 1 Feb 2019
Cross Ref
Solving the Hamiltonian Cycle Problem using a Quantum Computer
Proceedings of the Australasian Computer Science Week Multiconference | 29 January 2019
Cross Ref
Using Analytic Hierarchical Process for Scheduling Problems Based on Smart Lots and Their Quality Prediction Capability
Service Orientation in Holonic and Multi-Agent Manufacturing | 12 December 2018
Cross Ref
Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints
Computing and Combinatorics | 21 July 2019
Cross Ref
Exponential Time Approximation Scheme for TSP
Algorithmic Aspects in Information and Management | 1 August 2019
Cross Ref
Hamiltonicity Below Dirac’s Condition
Graph-Theoretic Concepts in Computer Science | 12 September 2019
Cross Ref
Optimization “In Windows” for Routing Problems with Constraints
Mathematical Optimization Theory and Operations Research | 27 October 2019
Cross Ref
Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency Quadrilaterals
Combinatorial Optimization and Applications | 23 November 2019
Cross Ref
Computing in Combinatorial Optimization
Computing and Software Science | 5 October 2019
Cross Ref
Special Frequency Quadrilaterals and an Application
Theoretical Computer Science | 1 September 2019
Cross Ref
Efficient solution algorithms for a time-critical reliable transportation problem in multigraph networks with FIFO property
Applied Soft Computing, Vol. 74 | 1 Jan 2019
Cross Ref
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
European Journal of Operational Research, Vol. 272, No. 1 | 1 Jan 2019
Cross Ref
A Polynomial Algorithm For Balancing a Sequence of Operations in Reconfigurable Transfer Lines
IFAC-PapersOnLine, Vol. 52, No. 13 | 1 Jan 2019
Cross Ref
Application of a generalized bottleneck routing problem to the task of adhering to acceptable doses of radiation during the dismantling of radiation hazardous objects
IFAC-PapersOnLine, Vol. 52, No. 13 | 1 Jan 2019
Cross Ref
Path Planning for a Land Leveler
2019 IEEE/SICE International Symposium on System Integration (SII) | 1 Jan 2019
Cross Ref
Dynamic programming approaches for the traveling salesman problem with drone
Networks, Vol. 72, No. 4 | 25 October 2018
Cross Ref
A Fast Algorithm on Minimum-Time Scheduling of an Autonomous Ground Vehicle Using a Traveling Salesman Framework
Journal of Dynamic Systems, Measurement, and Control, Vol. 140, No. 12 | 1 August 2018
Cross Ref
IntraClusTSP—An Incremental Intra-Cluster Refinement Heuristic Algorithm for Symmetric Travelling Salesman Problem
Symmetry, Vol. 10, No. 12 | 22 November 2018
Cross Ref
An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution
Applied Intelligence, Vol. 48, No. 11 | 27 June 2018
Cross Ref
Dynamic Programming Approach for Drone Routes Planning
2018 26th Telecommunications Forum (TELFOR) | 1 Nov 2018
Cross Ref
Parameterized Edge Hamiltonicity
Discrete Applied Mathematics, Vol. 248 | 1 Oct 2018
Cross Ref
Deep Learning for Exploration and Recovery of Uncharted and Dynamic Targets from UAV-like Vision
2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) | 1 Oct 2018
Cross Ref
Co-evolutionary multi-task learning for dynamic time series prediction
Applied Soft Computing, Vol. 70 | 1 Sep 2018
Cross Ref
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
International Journal of Production Research, Vol. 56, No. 14 | 11 January 2018
Cross Ref
Improving variable neighborhood search to solve the traveling salesman problem
Applied Soft Computing, Vol. 68 | 1 Jul 2018
Cross Ref
Incremental versus non-incremental dynamic programming
Operations Research Letters, Vol. 46, No. 3 | 1 May 2018
Cross Ref
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems
Theoretical Computer Science, Vol. 724 | 1 May 2018
Cross Ref
Transport concept selection considering supplier milk runs – An integrated model and a case study from the automotive industry
Transportation Research Part E: Logistics and Transportation Review, Vol. 113 | 1 May 2018
Cross Ref
A biobjective branch and bound procedure for planning spatial missions
Aerospace Science and Technology, Vol. 73 | 1 Feb 2018
Cross Ref
On the Fine-Grained Complexity of Rainbow Coloring
- Łukasz Kowalik,
- Juho Lauri, and
- Arkadiusz Socała
SIAM Journal on Discrete Mathematics, Vol. 32, No. 3 | 17 July 2018
Abstract PDF (640 KB)
Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem
Intelligence Science II | 2 October 2018
Cross Ref
Simple Paths and Cycles Avoiding Forbidden Paths
SOFSEM 2018: Theory and Practice of Computer Science | 22 December 2017
Cross Ref
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals
Frontiers in Algorithmics | 21 March 2018
Cross Ref
Exact Solution of One Production Scheduling Problem
Optimization Problems and Their Applications | 17 June 2018
Cross Ref
The Traveling Salesman Problem
Combinatorial Optimization | 14 March 2018
Cross Ref
Das Traveling-Salesman-Problem
Kombinatorische Optimierung | 25 July 2018
Cross Ref
Symmetric Travelling Salesman Problem
Mathematical Programming and Game Theory | 28 November 2018
Cross Ref
Market Schedule Equilibrium for Multimodal Systems
Informed Urban Transport Systems | 1 Jan 2018
Cross Ref
Network Design
Informed Urban Transport Systems | 1 Jan 2018
Cross Ref
References
Informed Urban Transport Systems | 1 Jan 2018
Cross Ref
Generalized a bottleneck routing problem: dynamic programming and the start point optimization
IFAC-PapersOnLine, Vol. 51, No. 32 | 1 Jan 2018
Cross Ref
Оptimization of the Start Point in the Gtsp with the Precedence Conditions
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", Vol. 11, No. 2 | 1 Jan 2018
Cross Ref
Quality of Experience-based museum touring: a human in the loop approach
Social Network Analysis and Mining, Vol. 7, No. 1 | 28 July 2017
Cross Ref
Approximation Schemes for the Generalized Traveling Salesman Problem
Proceedings of the Steklov Institute of Mathematics, Vol. 299, No. S1 | 8 February 2018
Cross Ref
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes
Algorithms for Molecular Biology, Vol. 12, No. 1 | 5 June 2017
Cross Ref
Parameterized Complexity of Superstring Problems
Algorithmica, Vol. 79, No. 3 | 28 July 2016
Cross Ref
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
Networks, Vol. 70, No. 3 | 8 April 2017
Cross Ref
On global integer extrema of real-valued box-constrained multivariate quadratic functions
Journal of Combinatorial Optimization, Vol. 34, No. 3 | 18 March 2017
Cross Ref
Solving large batches of traveling salesman problems with parallel and distributed computing
Computers & Operations Research, Vol. 85 | 1 Sep 2017
Cross Ref
An Application on Mobile Devices with Android and IOS Operating Systems Using Google Maps APIs for the Traveling Salesman Problem
Applied Artificial Intelligence, Vol. 31, No. 4 | 5 July 2017
Cross Ref
Design tools for reporter strands and DNA origami scaffold strands
Theoretical Computer Science, Vol. 671 | 1 Apr 2017
Cross Ref
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
Physical Review A, Vol. 95, No. 3 | 22 March 2017
Cross Ref
Energy-Aware Multiflight Planning for an Unattended Seaplane: Flying Fish
Journal of Aerospace Information Systems, Vol. 14, No. 2 | 1 Feb 2017
Cross Ref
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
Algorithms and Data Structures | 5 July 2017
Cross Ref
Solving Dynamic Traveling Salesman Problem with Ant Colony Communities
Computational Collective Intelligence | 7 September 2017
Cross Ref
Treewidth and Pathwidth parameterized by the vertex cover number
Discrete Applied Mathematics, Vol. 216 | 1 Jan 2017
Cross Ref
Towards Better Analysis of Deep Convolutional Neural Networks
IEEE Transactions on Visualization and Computer Graphics, Vol. 23, No. 1 | 1 Jan 2017
Cross Ref
About Routing in the Sheet Cutting
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", Vol. 10, No. 3 | 1 Jan 2017
Cross Ref
Dynamic Programming Approaches for the Traveling Salesman Problem with Drone
SSRN Electronic Journal, Vol. 9 | 1 Jan 2017
Cross Ref
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs
Journal of Information Processing, Vol. 25, No. 0 | 1 Jan 2017
Cross Ref
Scheduling with time-dependent discrepancy times
Journal of Scheduling, Vol. 19, No. 6 | 15 April 2016
Cross Ref
A computational model of topological and geometric recovery for visual curve completion
Computational Visual Media, Vol. 2, No. 4 | 30 May 2016
Cross Ref
Fast simulated annealing hybridized with quenching for solving job shop scheduling problem
Applied Soft Computing, Vol. 49 | 1 Dec 2016
Cross Ref
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
Information Sciences, Vol. 374 | 1 Dec 2016
Cross Ref
An exact algorithm with linear complexity for a problem of visiting megalopolises
Proceedings of the Steklov Institute of Mathematics, Vol. 295, No. S1 | 24 January 2017
Cross Ref
Routing under constraints: Problem of visit to megalopolises
Automation and Remote Control, Vol. 77, No. 11 | 12 November 2016
Cross Ref
The present and future of de novo whole-genome assembly
Briefings in Bioinformatics, Vol. 4 | 14 October 2016
Cross Ref
Traveling Salesman Problem for a Bidirectional Graph Using Dynamic Programming
2016 International Conference on Micro-Electronics and Telecommunication Engineering (ICMETE) | 1 Sep 2016
Cross Ref
A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem
2016 IEEE International Conference on Automation Science and Engineering (CASE) | 1 Aug 2016
Cross Ref
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
Computers & Operations Research, Vol. 71 | 1 Jul 2016
Cross Ref
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
Transportation Research Part B: Methodological, Vol. 89 | 1 Jul 2016
Cross Ref
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
New Journal of Physics, Vol. 18, No. 7 | 1 July 2016
Cross Ref
Families with Infants
ACM Transactions on Algorithms, Vol. 12, No. 3 | 25 April 2016
Cross Ref
On Problems as Hard as CNF-SAT
ACM Transactions on Algorithms, Vol. 12, No. 3 | 24 May 2016
Cross Ref
Exact algorithms for single-machine scheduling with time windows and precedence constraints
Journal of Scheduling, Vol. 19, No. 3 | 17 April 2015
Cross Ref
The bi-objective mixed capacitated general routing problem with different route balance criteria
European Journal of Operational Research, Vol. 251, No. 2 | 1 Jun 2016
Cross Ref
CuMAS
Proceedings of the 2016 International Conference on Supercomputing | 1 June 2016
Cross Ref
Near‐Optimal Assignment of UAVs to Targets Using a Market‐Based Approach
Operations Research for Unmanned Systems | 5 March 2016
Cross Ref
Comparison of some algorithms for centralized planning of AUV group operation for local heterogeneities survey
OCEANS 2016 - Shanghai | 1 Apr 2016
Cross Ref
An Iterative Approach for Collision Free Routing and Scheduling in Multirobot Stations
IEEE Transactions on Automation Science and Engineering, Vol. 13, No. 2 | 1 Apr 2016
Cross Ref
Exact Algorithms for Intervalizing Coloured Graphs
Theory of Computing Systems, Vol. 58, No. 2 | 15 March 2015
Cross Ref
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
Computers & Operations Research, Vol. 66 | 1 Feb 2016
Cross Ref
Bounding the Running Time of Algorithms for Scheduling and Packing Problems
- K. Jansen,
- F. Land, and
- K. Land
SIAM Journal on Discrete Mathematics, Vol. 30, No. 1 | 25 February 2016
Abstract PDF (382 KB)
Tropical Complexity, Sidon Sets, and Dynamic Programming
- Stasys Jukna
SIAM Journal on Discrete Mathematics, Vol. 30, No. 4 | 1 November 2016
Abstract PDF (507 KB)
Dynamic vehicle routing problems: Three decades and counting
Networks, Vol. 67, No. 1 | 17 August 2015
Cross Ref
Exact Algorithms for Treewidth
Encyclopedia of Algorithms | 22 April 2016
Cross Ref
Exact Algorithms on Graphs of Bounded Average Degree
Encyclopedia of Algorithms | 22 April 2016
Cross Ref
The Plant Propagation Algorithm for Discrete Optimisation: The Case of the Travelling Salesman Problem
Nature-Inspired Computation in Engineering | 20 March 2016
Cross Ref
$$P\mathop{ =}\limits^{?}NP$$
Open Problems in Mathematics | 6 July 2016
Cross Ref
A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
Discrete Optimization and Operations Research | 10 September 2016
Cross Ref
Routing problems: constraints and optimality**This work was supported by Act 211 Government of the Russian Federation, contract N 02.A03.21.0006
IFAC-PapersOnLine, Vol. 49, No. 12 | 1 Jan 2016
Cross Ref
Algebraic fingerprints for faster algorithms
Communications of the ACM, Vol. 59, No. 1 | 21 December 2015
Cross Ref
Feedback Energy Reduction in Massive MIMO Systems
2015 IEEE Global Communications Conference (GLOBECOM) | 1 Dec 2015
Cross Ref
Finding Supported Paths in Heterogeneous Networks
Algorithms, Vol. 8, No. 4 | 9 October 2015
Cross Ref
Adaptive stability: general approach and examples
Operational Research, Vol. 15, No. 3 | 7 May 2015
Cross Ref
Synchronization in hub terminals with the circular arrangement problem
Naval Research Logistics (NRL), Vol. 62, No. 6 | 26 August 2015
Cross Ref
Minimizing takeoff and landing risk in helicopter pickup and delivery operations
Omega, Vol. 55 | 1 Sep 2015
Cross Ref
Faster exponential-time algorithms in graphs of bounded average degree
Information and Computation, Vol. 243 | 1 Aug 2015
Cross Ref
An approximate method to compute a sparse graph for traveling salesman problem
Expert Systems with Applications, Vol. 42, No. 12 | 1 Jul 2015
Cross Ref
An evolutionary approach for solving the job shop scheduling problem in a service industry
International Journal of Advances in Intelligent Informatics, Vol. 1, No. 1 | 29 March 2015
Cross Ref
A decomposition heuristic for the twin robots scheduling problem
Naval Research Logistics (NRL), Vol. 62, No. 1 | 2 December 2014
Cross Ref
New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem
Knowledge and Systems Engineering | 1 Jan 2015
Cross Ref
End-Vertices of Graph Search Algorithms
Algorithms and Complexity | 16 May 2015
Cross Ref
Greedy Conjecture for Strings of Length 4
Combinatorial Pattern Matching | 16 June 2015
Cross Ref
Parameterized Complexity of Superstring Problems
Combinatorial Pattern Matching | 16 June 2015
Cross Ref
Exact Algorithms for Treewidth
Encyclopedia of Algorithms | 10 February 2015
Cross Ref
Exact Algorithms on Graphs of Bounded Average Degree
Encyclopedia of Algorithms | 10 February 2015
Cross Ref
Design and Implementation of a Line Balance Visualization and Editing Tool
ICoRD’15 – Research into Design Across Boundaries Volume 2 | 24 December 2014
Cross Ref
Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach
Computational Intelligence and Neuroscience, Vol. 2015 | 1 Jan 2015
Cross Ref
A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", Vol. 8, No. 1 | 1 Jan 2015
Cross Ref
An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality
International Journal of Applied Metaheuristic Computing, Vol. 6, No. 1 | 1 Jan 2015
Cross Ref
Feedback Energy Reduction in Massive MIMO Systems
2015 IEEE Global Communications Conference (GLOBECOM) | 1 Dec 2014
Cross Ref
How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 470, No. 2170 | 8 October 2014
Cross Ref
A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
Operations Research, Vol. 62, No. 5 | 1 Oct 2014
Cross Ref
Robust combinatorial optimization with variable cost uncertainty
European Journal of Operational Research, Vol. 237, No. 3 | 1 Sep 2014
Cross Ref
Aggregate Reinforcement Learning for multi-agent territory division: The Hide-and-Seek game
Engineering Applications of Artificial Intelligence, Vol. 34 | 1 Sep 2014
Cross Ref
Solving SCS for bounded length strings in fewer than steps
Information Processing Letters, Vol. 114, No. 8 | 1 Aug 2014
Cross Ref
Fifth to eleventh virial coefficients of hard spheres
Physical Review E, Vol. 90, No. 2 | 4 August 2014
Cross Ref
A Nearest Neighbor Method with a Frequency Graph for Traveling Salesman Problem
2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics | 1 Aug 2014
Cross Ref
General Bibliography
Paradigms of Combinatorial Optimization | 8 August 2014
Cross Ref
The Traveling Salesman Problem and its Variations
Paradigms of Combinatorial Optimization | 8 August 2014
Cross Ref
Balancing reconfigurable machining lines via a set partitioning model
International Journal of Production Research, Vol. 52, No. 13 | 31 October 2013
Cross Ref
A new upper bound for the traveling salesman problem in cubic graphs
Journal of Discrete Algorithms, Vol. 27 | 1 Jul 2014
Cross Ref
Model and Algorithm for Wagons' Placing-In and Taking-Out Problem in Railway Station
CICTP 2014 | 2 July 2014
Cross Ref
Limitations of Incremental Dynamic Programming
Algorithmica, Vol. 69, No. 2 | 22 January 2013
Cross Ref
A new graph model and algorithms for consistent superstring problems
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 372, No. 2016 | 28 May 2014
Cross Ref
An exact iterative search algorithm for constrained Markov decision processes
Automatica, Vol. 50, No. 5 | 1 May 2014
Cross Ref
Fast monotone summation over disjoint sets
Information Processing Letters, Vol. 114, No. 5 | 1 May 2014
Cross Ref
A new approach for maximum utilization of the mother steel plates for rectangular steel plates orders
2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) | 1 May 2014
Cross Ref
On Cutwidth Parameterized by Vertex Cover
Algorithmica, Vol. 68, No. 4 | 8 November 2012
Cross Ref
Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
Mathematical Programming, Vol. 144, No. 1-2 | 19 January 2013
Cross Ref
An optical fiber network oracle for NP-complete problems
Light: Science & Applications, Vol. 3, No. 2 | 28 February 2014
Cross Ref
Determinant Sums for Undirected Hamiltonicity
- Andreas Björklund
SIAM Journal on Computing, Vol. 43, No. 1 | 20 February 2014
Abstract PDF (314 KB)
Exact Algorithms
Manufacturing Scheduling Systems | 20 February 2014
Cross Ref
Average-Case Analysis
The Logic of Logistics | 21 October 2013
Cross Ref
Clearing Connections by Few Agents
Fun with Algorithms | 1 Jan 2014
Cross Ref
Edge Elimination in TSP Instances
Graph-Theoretic Concepts in Computer Science | 21 October 2014
Cross Ref
Families with Infants: A General Approach to Solve Hard Partition Problems
Automata, Languages, and Programming | 1 Jan 2014
Cross Ref
On One Approach to TSP Structural Stability
Advances in Operations Research, Vol. 2014 | 1 Jan 2014
Cross Ref
Model of Wagons’ Placing-In and Taking-Out Problem in a Railway Station and Its Heuristic Algorithm
Mathematical Problems in Engineering, Vol. 2014 | 1 Jan 2014
Cross Ref
The deterministic product location problem under a pick-by-order policy
Discrete Applied Mathematics, Vol. 161, No. 18 | 1 Dec 2013
Cross Ref
A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) | 1 Dec 2013
Cross Ref
Kernel bounds for path and cycle problems
Theoretical Computer Science, Vol. 511 | 1 Nov 2013
Cross Ref
A Representation Model for TSP
2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing | 1 Nov 2013
Cross Ref
A Market-based Solution to the Multiple Traveling Salesmen Problem
Journal of Intelligent & Robotic Systems, Vol. 72, No. 1 | 30 January 2013
Cross Ref
The Parity of Directed Hamiltonian Cycles
2013 IEEE 54th Annual Symposium on Foundations of Computer Science | 1 Oct 2013
Cross Ref
The Parameterized Complexity of Local Search for TSP, More Refined
Algorithmica, Vol. 67, No. 1 | 8 September 2012
Cross Ref
Correlated topographic analysis: estimating an ordering of correlated components
Machine Learning, Vol. 92, No. 2-3 | 14 May 2013
Cross Ref
Naturally selecting solutions
Bioengineered, Vol. 4, No. 5 | 27 October 2014
Cross Ref
Dynamic Drum-Buffer-Rope approach for production planning and control in capacitated flow-shop manufacturing systems
Computers & Industrial Engineering, Vol. 65, No. 4 | 1 Aug 2013
Cross Ref
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
Central European Journal of Operations Research, Vol. 21, No. S1 | 28 August 2012
Cross Ref
Exact exponential algorithms
Communications of the ACM, Vol. 56, No. 3 | 1 March 2013
Cross Ref
The Traveling Salesman Problem and its Variations
Paradigms of Combinatorial Optimization | 13 February 2013
Cross Ref
Exact algorithms for inventory constrained scheduling on a single machine
Journal of Scheduling, Vol. 16, No. 1 | 20 December 2011
Cross Ref
Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches
Handbook of Combinatorial Optimization | 26 July 2013
Cross Ref
Algebrization and Randomization Methods
Handbook of Combinatorial Optimization | 26 July 2013
Cross Ref
Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree
Automata, Languages, and Programming | 1 Jan 2013
Cross Ref
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
Algorithms and Data Structures | 1 Jan 2013
Cross Ref
Bounding the Running Time of Algorithms for Scheduling and Packing Problems
Algorithms and Data Structures | 1 Jan 2013
Cross Ref
Exact and Parameterized Algorithms for Max Internal Spanning Tree
Algorithmica, Vol. 65, No. 1 | 30 September 2011
Cross Ref
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
Algorithmica, Vol. 65, No. 1 | 26 September 2011
Cross Ref
A flexible dispatching rule for minimizing tardiness in job shop scheduling
International Journal of Production Economics, Vol. 141, No. 1 | 1 Jan 2013
Cross Ref
Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel
Mathematical Problems in Engineering, Vol. 2013 | 1 Jan 2013
Cross Ref
Exact Algorithms for Single-Machine Scheduling with Time Windows and Precedence Constraints
SSRN Electronic Journal, Vol. 39 | 1 Jan 2013
Cross Ref
Solving the job-shop scheduling problem optimally by dynamic programming
Computers & Operations Research, Vol. 39, No. 12 | 1 Dec 2012
Cross Ref
Coherent image selection using a fast approximation to the generalized traveling salesman problem
Proceedings of the 20th ACM international conference on Multimedia | 29 October 2012
Cross Ref
Highway network restoration after the great flood in Thailand
Natural Hazards, Vol. 64, No. 1 | 21 July 2012
Cross Ref
Scheduling with multi-attribute setup times
Computers & Industrial Engineering, Vol. 63, No. 2 | 1 Sep 2012
Cross Ref
Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods
Journal of Intelligent Manufacturing, Vol. 23, No. 4 | 13 July 2010
Cross Ref
Descending rolling horizon procedure for equipment replacement problem
Proceedings of the 10th World Congress on Intelligent Control and Automation | 1 Jul 2012
Cross Ref
Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros
International Journal of Operations Research and Information Systems, Vol. 3, No. 3 | 1 Jul 2012
Cross Ref
Comparing the Robustness of Market-Based Task Assignment to Genetic Algorithm
Infotech@Aerospace 2012 | 6 September 2012
Cross Ref
On the Scalability of the Market-Based Solution to the Multiple Traveling Salesmen Problem
Infotech@Aerospace 2012 | 6 September 2012
Cross Ref
A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits
Infotech@Aerospace 2012 | 6 September 2012
Cross Ref
On Problems as Hard as CNF-SAT
2012 IEEE 27th Conference on Computational Complexity | 1 Jun 2012
Cross Ref
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Computers & Operations Research, Vol. 39, No. 5 | 1 May 2012
Cross Ref
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers & Operations Research, Vol. 39, No. 5 | 1 May 2012
Cross Ref
Algorithms for underwater local heterogeneity survey based on AUV group usage
2012 Oceans - Yeosu | 1 May 2012
Cross Ref
Balancing reconfigurable machining lines by means of set partitioning model
IFAC Proceedings Volumes, Vol. 45, No. 6 | 1 May 2012
Cross Ref
Landscape Encodings Enhance Optimization
PLoS ONE, Vol. 7, No. 4 | 9 April 2012
Cross Ref
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Theory of Computing Systems, Vol. 50, No. 3 | 21 January 2011
Cross Ref
A complexity model for sequence planning in mixed-model assembly lines
Journal of Manufacturing Systems, Vol. 31, No. 2 | 1 Apr 2012
Cross Ref
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms, Vol. 8, No. 2 | 25 April 2012
Cross Ref
Symmetry Matters for Sizes of Extended Formulations
SIAM Journal on Discrete Mathematics, Vol. 26, No. 3 | 18 September 2012
Abstract PDF (329 KB)
On Cutwidth Parameterized by Vertex Cover
Parameterized and Exact Computation | 1 Jan 2012
Cross Ref
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
Algorithms – ESA 2012 | 1 Jan 2012
Cross Ref
Fast Monotone Summation over Disjoint Sets
Parameterized and Exact Computation | 1 Jan 2012
Cross Ref
Information in the Traveling Salesman Problem
Applied Mathematics, Vol. 03, No. 08 | 1 Jan 2012
Cross Ref
Multi-product lot-sizing and sequencing on a single imperfect machine
Computational Optimization and Applications, Vol. 50, No. 3 | 23 October 2010
Cross Ref
A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases
European Journal of Operational Research, Vol. 215, No. 3 | 1 Dec 2011
Cross Ref
Method of scaling in approximate solution of the traveling salesman problem
Automation and Remote Control, Vol. 72, No. 12 | 21 December 2011
Cross Ref
Evolutionary algorithms and dynamic programming
Theoretical Computer Science, Vol. 412, No. 43 | 1 Oct 2011
Cross Ref
The traveling salesrat: insights into the dynamics of efficient spatial navigation in the rodent
Journal of Neural Engineering, Vol. 8, No. 6 | 4 November 2011
Cross Ref
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
Evolutionary Computation, Vol. 19, No. 3 | 1 Sep 2011
Cross Ref
Dominance rules in combinatorial optimization problems
European Journal of Operational Research, Vol. 212, No. 3 | 1 Aug 2011
Cross Ref
Finding and enumerating Hamilton cycles in 4-regular graphs
Theoretical Computer Science, Vol. 412, No. 35 | 1 Aug 2011
Cross Ref
Scheduling just-in-time part supply for mixed-model assembly lines
European Journal of Operational Research, Vol. 211, No. 1 | 1 May 2011
Cross Ref
Rolling horizon procedure for large-scale equipment replacement problems with multiple alternatives
2011 Chinese Control and Decision Conference (CCDC) | 1 May 2011
Cross Ref
Tasks Allocation to Agents using Market-Based Techniques
Infotech@Aerospace 2011 | 1 June 2011
Cross Ref
The traveling purchaser problem with stochastic prices: Exact and approximate algorithms
European Journal of Operational Research, Vol. 209, No. 3 | 1 Mar 2011
Cross Ref
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
- Jiong Guo,
- Rolf Niedermeier, and
- Ondřej Suchý
SIAM Journal on Discrete Mathematics, Vol. 25, No. 2 | 27 June 2011
Abstract PDF (268 KB)
Combinatorial Traveling Salesman Problem Algorithms
Wiley Encyclopedia of Operations Research and Management Science | 15 February 2011
Cross Ref
Sensitivity Analysis and Dynamic Programming
Wiley Encyclopedia of Operations Research and Management Science | 15 February 2011
Cross Ref
Exact Algorithms for Intervalizing Colored Graphs
Theory and Practice of Algorithms in (Computer) Systems | 1 Jan 2011
Cross Ref
On Complexity of the Optimal Recombination for the Travelling Salesman Problem
Evolutionary Computation in Combinatorial Optimization | 1 Jan 2011
Cross Ref
Invitation to Algorithmic Uses of Inclusion–Exclusion
Automata, Languages and Programming | 1 Jan 2011
Cross Ref
Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm
Memetic Computing, Vol. 2, No. 4 | 26 February 2010
Cross Ref
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
Transportation Science, Vol. 44, No. 4 | 1 Nov 2010
Cross Ref
Determinant Sums for Undirected Hamiltonicity
2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
Cross Ref
Evaluation of permanents in rings and semirings
Information Processing Letters, Vol. 110, No. 20 | 1 Sep 2010
Cross Ref
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
Cross Ref
An extremal constrained routing problem with internal losses
Russian Mathematics, Vol. 54, No. 6 | 2 May 2010
Cross Ref
Multi-product lot sizing and scheduling on unrelated parallel machines
IIE Transactions, Vol. 42, No. 7 | 30 Apr 2010
Cross Ref
Fifty-Plus Years of Combinatorial Integer Programming
50 Years of Integer Programming 1958-2008 | 6 November 2009
Cross Ref
Exact and Parameterized Algorithms for Max Internal Spanning Tree
Graph-Theoretic Concepts in Computer Science | 1 Jan 2010
Cross Ref
Symmetry Matters for the Sizes of Extended Formulations
Integer Programming and Combinatorial Optimization | 1 Jan 2010
Cross Ref
Covering and Packing in Linear Space
Automata, Languages and Programming | 1 Jan 2010
Cross Ref
Approaching the fuzzy road transport traveling salesman problem by eugenic bacterial memetic, algorithm
2009 4th International Symposium on Computational Intelligence and Intelligent Informatics | 1 Oct 2009
Cross Ref
Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph
IIE Transactions, Vol. 41, No. 10 | 17 Aug 2009
Cross Ref
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation | 8 July 2009
Cross Ref
Lower bounds for earliness-tardiness minimization on a single machine
2009 International Conference on Computers & Industrial Engineering | 1 Jul 2009
Cross Ref
A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
Engineering Optimization, Vol. 41, No. 6 | 1 Jun 2009
Cross Ref
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Algorithmica, Vol. 53, No. 3 | 28 September 2007
Cross Ref
Finding paths of length k in time
Information Processing Letters, Vol. 109, No. 6 | 1 Feb 2009
Cross Ref
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing, Vol. 39, No. 2 | 23 July 2009
Abstract PDF (265 KB)
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
Automata, Languages and Programming | 1 Jan 2009
Cross Ref
Counting Paths and Packings in Halves
Algorithms - ESA 2009 | 1 Jan 2009
Cross Ref
An Active Global Attack Model for Sensor Source Location Privacy: Analysis and Countermeasures
Security and Privacy in Communication Networks | 1 Jan 2009
Cross Ref
Dynamic Policy-Based Routing Using Firewall Rules
2009 Third UKSim European Symposium on Computer Modeling and Simulation | 1 Jan 2009
Cross Ref
Multi-product lot-sizing and scheduling on unrelated parallel machines to minimize makespan
IFAC Proceedings Volumes, Vol. 42, No. 4 | 1 Jan 2009
Cross Ref
Constrained optimal routing
Doklady Mathematics, Vol. 78, No. 3 | 24 December 2008
Cross Ref
Scheduling Design and Verification for Open Soft Real-Time Systems
2008 Real-Time Systems Symposium | 1 Nov 2008
Cross Ref
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
Algorithmica, Vol. 52, No. 2 | 22 September 2007
Cross Ref
An exact approach to minimizing the sum of maximum earliness and tardiness with unequal release times
2008 IEEE International Conference on Service Operations and Logistics, and Informatics | 1 Oct 2008
Cross Ref
Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis
Psychometrika, Vol. 73, No. 3 | 4 December 2007
Cross Ref
Exact solution procedures for the balanced unidirectional cyclic layout problem
European Journal of Operational Research, Vol. 189, No. 3 | 1 Sep 2008
Cross Ref
Job shop scheduling with setup times, deadlines and precedence constraints
Journal of Scheduling, Vol. 11, No. 4 | 1 August 2008
Cross Ref
Minimizing the earliness-tardiness costs on a single machine
2008 International Conference on Service Systems and Service Management | 1 Jun 2008
Cross Ref
A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages
IEEE Transactions on Intelligent Transportation Systems, Vol. 9, No. 2 | 1 Jun 2008
Cross Ref
Exact Algorithms for Treewidth and Minimum Fill-In
- Fedor V. Fomin,
- Dieter Kratsch,
- Ioan Todinca, and
- Yngve Villanger
SIAM Journal on Computing, Vol. 38, No. 3 | 2 July 2008
Abstract PDF (265 KB)
Dynamic Programming in Clustering
Encyclopedia of Optimization | 1 Jan 2008
Cross Ref
Traveling Salesman Problem
Encyclopedia of Optimization | 1 Jan 2008
Cross Ref
Scheduling for Reliable Execution in Autonomic Systems
Autonomic and Trusted Computing | 1 Jan 2008
Cross Ref
The Travelling Salesman Problem in Bounded Degree Graphs
Automata, Languages and Programming | 1 Jan 2008
Cross Ref
Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
Metaheuristics for Scheduling in Industrial and Manufacturing Applications | 1 Jan 2008
Cross Ref
Lot-Sizing and Sequencing on a Single Imperfect Machine
Modelling, Computation and Optimization in Information Systems and Management Sciences | 1 Jan 2008
Cross Ref
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers & Operations Research, Vol. 34, No. 10 | 1 Oct 2007
Cross Ref
Real-time optimisation of access control lists for efficient Internet packet filtering
Journal of Heuristics, Vol. 13, No. 5 | 7 April 2007
Cross Ref
Greedoid-Based Noncompensatory Inference
Marketing Science, Vol. 26, No. 4 | 1 Jul 2007
Cross Ref
FMS scheduling based on timed Petri Net model and reactive graph search
Applied Mathematical Modelling, Vol. 31, No. 6 | 1 Jun 2007
Cross Ref
Customer order scheduling on a single machine with family setup times: Complexity and algorithms
Applied Mathematics and Computation, Vol. 185, No. 1 | 1 Feb 2007
Cross Ref
Single machine scheduling under market uncertainty
European Journal of Operational Research, Vol. 177, No. 1 | 1 Feb 2007
Cross Ref
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
- Alan Frieze and
- Gregory B. Sorkin
SIAM Journal on Computing, Vol. 36, No. 5 | 26 January 2007
Abstract PDF (235 KB)
Exact BDD Minimization for Path-Related Objective Functions
Vlsi-Soc: From Systems To Silicon | 1 Jan 2007
Cross Ref
An Improved Exact Algorithm for Cubic Graph TSP
Computing and Combinatorics | 1 Jan 2007
Cross Ref
A Modified Binary Particle Swarm Optimization Algorithm for Permutation Flow Shop Problem
2007 International Conference on Machine Learning and Cybernetics | 1 Jan 2007
Cross Ref
Recent Trends in Intelligent Job Shop Scheduling
2006 1ST IEEE International Conference on E-Learning in Industrial Electronics | 1 Dec 2006
Cross Ref
Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
International Journal of Production Research, Vol. 44, No. 22 | 15 Nov 2006
Cross Ref
Inclusion--Exclusion Algorithms for Counting Set Partitions
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) | 1 Oct 2006
Cross Ref
An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
European Journal of Operational Research, Vol. 168, No. 3 | 1 Feb 2006
Cross Ref
The Operation of Manufacturing Systems
Manufacturing Systems: Theory and Practice | 1 Jan 2006
Cross Ref
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
LATIN 2006: Theoretical Informatics | 1 Jan 2006
Cross Ref
An Exact Algorithm for the Minimum Dominating Clique Problem
Parameterized and Exact Computation | 1 Jan 2006
Cross Ref
Solving Connected Dominating Set Faster Than 2 n
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 1 Jan 2006
Cross Ref
The traveling salesman problem with few inner points
Operations Research Letters, Vol. 34, No. 1 | 1 Jan 2006
Cross Ref
Embedded local search approaches for routing optimization
Computers & Operations Research, Vol. 32, No. 3 | 1 Mar 2005
Cross Ref
Measure and Conquer: Domination – A Case Study
Automata, Languages and Programming | 1 Jan 2005
Cross Ref
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Mathematical Foundations of Computer Science 2005 | 1 Jan 2005
Cross Ref
Optimal solution methods for the minimum-backtracking row layout problem
IIE Transactions, Vol. 36, No. 2 | 1 Feb 2004
Cross Ref
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
Automata, Languages and Programming | 1 Jan 2004
Cross Ref
The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure
European Journal of Operational Research, Vol. 152, No. 1 | 1 Jan 2004
Cross Ref
Particle swarm optimization algorithm for single machine total weighted tardiness problem
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) | 1 Jan 2004
Cross Ref
Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation
Computational Linguistics, Vol. 29, No. 1 | 1 Mar 2003
Cross Ref
Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem
SSRN Electronic Journal, Vol. 39 | 1 Jan 2003
Cross Ref
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms, Vol. 45, No. 2 | 1 Nov 2002
Cross Ref
Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products
International Journal of Production Economics, Vol. 78, No. 3 | 1 Aug 2002
Cross Ref
BPA: a fast packet scheduling algorithm for real-time switched Ethernet networks
Proceedings International Conference on Parallel Processing | 1 Jan 2002
Cross Ref
An integrated approach to disassembly planning and demanufacturing operation
IEEE Transactions on Robotics and Automation, Vol. 17, No. 6 | 1 Dec 2001
Cross Ref
Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations
Mathematical and Computer Modelling, Vol. 33, No. 8-9 | 1 Apr 2001
Cross Ref
An interactive multiobjective programming approach to combinatorial data analysis
Psychometrika, Vol. 66, No. 1 | 1 Mar 2001
Cross Ref
Dynamic Programming in Clustering
Encyclopedia of Optimization | 1 Jan 2001
Cross Ref
Sequencing jobs on a single machine: A neural network approach
European Journal of Operational Research, Vol. 126, No. 3 | 1 Nov 2000
Cross Ref
Polynomial time algorithms for some minimum latency problems
Information Processing Letters, Vol. 75, No. 5 | 1 Oct 2000
Cross Ref
Intensification and Diversification Strategies with Tabu Search: One-Machine Problem with Weighted Tardiness Objective
MICAI 2000: Advances in Artificial Intelligence | 1 Jan 2000
Cross Ref
An alternate formulation of the symmetric traveling salesman problem and its properties
Discrete Applied Mathematics, Vol. 98, No. 3 | 1 Jan 2000
Cross Ref
Cluster based branching for the asymmetric traveling salesman problem
European Journal of Operational Research, Vol. 119, No. 2 | 1 Dec 1999
Cross Ref
An Õ(2n) volume molecular algorithm for Hamiltonian path
Biosystems, Vol. 52, No. 1-3 | 1 Oct 1999
Cross Ref
Submodularity and the traveling salesman problem
European Journal of Operational Research, Vol. 114, No. 3 | 1 May 1999
Cross Ref
Erratum: The Travelling Salesman and the PQ-Tree
Mathematics of Operations Research, Vol. 24, No. 1 | 1 Feb 1999
Cross Ref
Problem of optimal choice of a route under conditions of time discounting
Cybernetics and Systems Analysis, Vol. 35, No. 1 | 1 Jan 1999
Cross Ref
Genetic algorithm for single machine scheduling with general early-tardy penalty weights
Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251) | 1 Jan 1999
Cross Ref
The Travelling Salesman and the PQ-Tree
Mathematics of Operations Research, Vol. 23, No. 3 | 1 Aug 1998
Cross Ref
Probabilistic Analysis of Algorithms
Probabilistic Methods for Algorithmic Discrete Mathematics | 1 Jan 1998
Cross Ref
An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method
IEEE Transactions on Robotics and Automation, Vol. 14, No. 5 | 1 Jan 1998
Cross Ref
Production sequencing problem with reentrant work flows and sequence dependent setup times
Computers & Industrial Engineering, Vol. 33, No. 3-4 | 1 Dec 1997
Cross Ref
MIP modelling of changeovers in production planning and scheduling problems
European Journal of Operational Research, Vol. 99, No. 1 | 1 May 1997
Cross Ref
Dynamic programming: a different perspective
Algorithmic Languages and Calculi | 1 Jan 1997
Cross Ref
The dynamic programming method in the generalized traveling salesman problem
Mathematical and Computer Modelling, Vol. 25, No. 1 | 1 Jan 1997
Cross Ref
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
Parallel Algorithms and Applications, Vol. 10, No. 3-4 | 1 Jan 1997
Cross Ref
Material allocation in MRP with tardiness penalties
Journal of Global Optimization, Vol. 9, No. 3-4 | 1 Dec 1996
Cross Ref
Production planning of FMS under tool magazine constraints: A dynamic programming approach
The International Journal of Advanced Manufacturing Technology, Vol. 11, No. 5 | 1 Sep 1996
Cross Ref
The use of dynamic programming in genetic algorithms for permutation problems
European Journal of Operational Research, Vol. 92, No. 2 | 1 Jul 1996
Cross Ref
Scheduling Permutation Flow Shops Using the Lagrangian Relaxation Technique
IFAC Proceedings Volumes, Vol. 29, No. 1 | 1 Jun 1996
Cross Ref
Sevast'yanov's algorithm for the flow-shop scheduling problem
European Journal of Operational Research, Vol. 91, No. 1 | 1 May 1996
Cross Ref
A survey of approaches to the job shop scheduling problem
Proceedings of 28th Southeastern Symposium on System Theory | 1 Jan 1996
Cross Ref
A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
Journal of the Operations Research Society of Japan, Vol. 39, No. 3 | 1 Jan 1996
Cross Ref
Minimizing the sum of weighted completion times with unrestricted weights
Discrete Applied Mathematics, Vol. 63, No. 1 | 1 Oct 1995
Cross Ref
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
Computers & Operations Research, Vol. 22, No. 8 | 1 Oct 1995
Cross Ref
Solving the max-cut problem using eigenvalues
Discrete Applied Mathematics, Vol. 62, No. 1-3 | 1 Sep 1995
Cross Ref
Line balancing for non-traditional assembly lines, mixed models, and sequence-dependent assembly times
International Journal of Computer Integrated Manufacturing, Vol. 8, No. 4 | 1 Jul 1995
Cross Ref
A BRANCH‐AND‐BOUND APPROACH FOR SEQUENCING EXPANSION PROJECTS
Production and Operations Management, Vol. 4, No. 1 | 3 January 1995
Cross Ref
Chapter 1 Vehicle routing
Network Routing | 1 Jan 1995
Cross Ref
Tabu search performance on the symmetric traveling salesman problem
Computers & Operations Research, Vol. 21, No. 8 | 1 Oct 1994
Cross Ref
An efficient algorithm for the single machine tardiness problem
International Journal of Production Economics, Vol. 36, No. 2 | 1 Sep 1994
Cross Ref
A dynamic programming method for single machine scheduling
European Journal of Operational Research, Vol. 76, No. 1 | 1 Jul 1994
Cross Ref
Special cases of the traveling salesman problem
Applied Mathematics and Computation, Vol. 60, No. 2-3 | 1 Feb 1994
Cross Ref
A scheduling framework based on Petri net modeling and sequential Lagrangian relaxation approach
Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology | 1 Jan 1994
Cross Ref
Inclusion and exclusion algorithm for the Hamiltonian path problem
Information Processing Letters, Vol. 47, No. 4 | 1 Sep 1993
Cross Ref
The searching over separators strategy to solve some NP-hard problems in subexponential time
Algorithmica, Vol. 9, No. 4 | 1 Apr 1993
Cross Ref
The traveling salesman problem with cumulative costs
Networks, Vol. 23, No. 2 | 11 October 2006
Cross Ref
Schedule of jobs on two identical machines to minimize weighted mean flow time
Computers & Industrial Engineering, Vol. 24, No. 1 | 1 Jan 1993
Cross Ref
A practical approach to job-shop scheduling problems
IEEE Transactions on Robotics and Automation, Vol. 9, No. 1 | 1 Jan 1993
Cross Ref
Optimal partition for shop floor control in semiconductor wafer fabrication
European Journal of Operational Research, Vol. 59, No. 2 | 1 Jun 1992
Cross Ref
The Operation of Manufacturing Systems
Manufacturing Systems | 1 Jan 1992
Cross Ref
Auswahl von theoriebezogenen Veröffentlichungen
Optimierung | 1 Jan 1992
Cross Ref
Dynamic programming with convexity, concavity and sparsity
Theoretical Computer Science, Vol. 92, No. 1 | 1 Jan 1992
Cross Ref
Two classes of effective heuristics for time value functions based scheduling
Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems | 1 Jan 1992
Cross Ref
Solution of large-scale symmetric travelling salesman problems
Mathematical Programming, Vol. 51, No. 1-3 | 1 Jul 1991
Cross Ref
Assembly line research: Historical roots, research life cycles and future directions
Omega, Vol. 19, No. 5 | 1 Jan 1991
Cross Ref
Single machine scheduling with nonlinear cost functions
Computers & Operations Research, Vol. 18, No. 3 | 1 Jan 1991
Cross Ref
Analysis of heuristics for job sequencing in manufacturing flow line work-cells
Computers & Industrial Engineering, Vol. 20, No. 1 | 1 Jan 1991
Cross Ref
Advances in Manufacturing Assembly Systems
Manufacturing and Automation Systems: Techniques and Technologies, Part 2 of 5 | 1 Jan 1991
Cross Ref
A diagonal completion and 2-optimal procedure for the travelling salesman problem
Mathematical and Computer Modelling, Vol. 13, No. 3 | 1 Jan 1990
Cross Ref
A Lagrangian relaxation approach to job shop scheduling problems
Proceedings., IEEE International Conference on Robotics and Automation | 1 Jan 1990
Cross Ref
The travelling salesman problem: selected algorithms and heuristics†
International Journal of Mathematical Education in Science and Technology, Vol. 20, No. 6 | 1 Nov 1989
Cross Ref
Component-placement optimization for convectively cooled electronics
IEEE Transactions on Reliability, Vol. 38, No. 2 | 1 Jun 1989
Cross Ref
A simple linear expected time algorithm for finding a hamilton path
Discrete Mathematics, Vol. 75, No. 1-3 | 1 May 1989
Cross Ref
A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems
International Journal of Production Research, Vol. 27, No. 4 | 29 March 2007
Cross Ref
An algorithm for finding hamilton paths and cycles in random graphs
Combinatorica, Vol. 7, No. 4 | 1 Dec 1987
Cross Ref
A HEURISTIC ALGORITHM FOR THE TRAVELLING SALESMAN PROBLEM WITH TIME-VARYING TRAVEL COSTS
Engineering Optimization, Vol. 12, No. 4 | 1 Oct 1987
Cross Ref
Expected Computation Time for Hamiltonian Path problem
- Yuri Gurevich and
- Saharon Shelah
SIAM Journal on Computing, Vol. 16, No. 3 | 13 July 2006
Abstract PDF (2164 KB)
An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
USSR Computational Mathematics and Mathematical Physics, Vol. 27, No. 4 | 1 Jan 1987
Cross Ref
A dynamic programming based heuristic for machine grouping in manufacturing cell formation
Computers & Industrial Engineering, Vol. 12, No. 3 | 1 Jan 1987
Cross Ref
Sequential algorithm for the solution of problems of combinatorial optimization on permutations
Cybernetics, Vol. 21, No. 6 | 1 Jan 1986
Cross Ref
Relative performance of micro and mainframe computers: Two case studies
Computers & Industrial Engineering, Vol. 10, No. 2 | 1 Jan 1986
Cross Ref
On the refinement of bounds of heuristic algorithms for the traveling salesman problem
Mathematical Programming, Vol. 32, No. 1 | 1 May 1985
Cross Ref
Integer programming formulations of vehicle routing problems
European Journal of Operational Research, Vol. 20, No. 1 | 1 Apr 1985
Cross Ref
Hierarchical vehicle routing problems
Networks, Vol. 14, No. 4 | 11 October 2006
Cross Ref
An Algorithm for NC Turret Punch Press Tool Location and Hit Sequencing
IIE Transactions, Vol. 16, No. 3 | 6 July 2007
Cross Ref
Production scheduling of independent jobs on parallel identical processors
International Journal of Production Research, Vol. 22, No. 4 | 30 March 2007
Cross Ref
Scheduling of tasks for distributed processors
ACM SIGARCH Computer Architecture News, Vol. 12, No. 3 | 1 January 1984
Cross Ref
The Traveling Salesman Problem with Many Visits to Few Cities
- Stavros S. Cosmadakis and
- Christos H. Papadimitriou
SIAM Journal on Computing, Vol. 13, No. 1 | 2 August 2006
Abstract PDF (1209 KB)
Task Scheduling on Multiprocessors for Power System Problems
IEEE Transactions on Power Apparatus and Systems, Vol. PAS-102, No. 11 | 1 Nov 1983
Cross Ref
The traveling salesman problem: An update of research
Naval Research Logistics Quarterly, Vol. 30, No. 1 | 10 October 2006
Cross Ref
The Travelling Salesman Problem and Minimum Matching in the Unit Square
SIAM Journal on Computing, Vol. 12, No. 1 | 31 July 2006
Abstract PDF (1169 KB)
Recent Results in the Theory of Machine Scheduling
Mathematical Programming The State of the Art | 1 Jan 1983
Cross Ref
Hybrid algorithm for sequencing with bicriteria
Journal of Optimization Theory and Applications, Vol. 39, No. 1 | 1 Jan 1983
Cross Ref
Set-up times in cyclic and acyclic Group Technology Scheduling systems
International Journal of Production Research, Vol. 21, No. 1 | 27 April 2007
Cross Ref
Dynamic programming meets the principle of inclusion and exclusion
Operations Research Letters, Vol. 1, No. 2 | 1 Apr 1982
Cross Ref
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- J. H. Halton and
- R. Terada
SIAM Journal on Computing, Vol. 11, No. 1 | 31 July 2006
Abstract PDF (1669 KB)
Solving a multiobjective traveling salesman problem by dynamic programming
Mathematische Operationsforschung und Statistik. Series Optimization, Vol. 13, No. 2 | 27 June 2007
Cross Ref
On the choice of step size in subgradient optimization
European Journal of Operational Research, Vol. 7, No. 4 | 1 Aug 1981
Cross Ref
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
Networks, Vol. 11, No. 2 | 11 October 2006
Cross Ref
Optimization problems in computer network design
Computer Networks (1976), Vol. 5, No. 3 | 1 May 1981
Cross Ref
A survey of scheduling methods for multiprocessor systems
Journal of Soviet Mathematics, Vol. 15, No. 5 | 1 Jan 1981
Cross Ref
Dynamic Decisions and Work Load in Multitask Supervisory Control
IEEE Transactions on Systems, Man, and Cybernetics, Vol. 10, No. 5 | 1 May 1980
Cross Ref
Graphentheorie — Modelle und Methoden
Quantitative Wirtschafts- und Unternehmensforschung | 1 Jan 1980
Cross Ref
Using multidimensional scaling to solve traveling salesman and machine scheduling problems
Computers & Operations Research, Vol. 7, No. 3 | 1 Jan 1980
Cross Ref
A multiple objective decision theoretic approach to one-machine scheduling problems
Computers & Operations Research, Vol. 7, No. 4 | 1 Jan 1980
Cross Ref
One - processor scheduling with nonuniform ready times
Mathematische Operationsforschung und Statistik. Series Optimization, Vol. 10, No. 1 | 27 June 2007
Cross Ref
Using cutting planes to solve the symmetric Travelling Salesman problem
Mathematical Programming, Vol. 15, No. 1 | 1 Dec 1978
Cross Ref
Some optimal path problems subject to improvements
Zeitschrift für Operations Research, Vol. 22, No. 1 | 1 Dec 1978
Cross Ref
Four solution techniques for a general one machine scheduling problem
European Journal of Operational Research, Vol. 2, No. 4 | 1 Jul 1978
Cross Ref
An Implicit Enumeration Algorithm for Sequencing Policies Applied to Telephone Switching Facilities
IEEE Transactions on Systems, Man, and Cybernetics, Vol. 8, No. 4 | 1 Apr 1978
Cross Ref
The Layout of Divisible Activities on the Line
A I I E Transactions, Vol. 10, No. 1 | 9 July 2007
Cross Ref
COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING
Dynamic Programming and its Applications | 1 Jan 1978
Cross Ref
A statistical approach to the tsp
Networks, Vol. 7, No. 3 | 11 October 2006
Cross Ref
Application of Sequencing Policies to Telephone Switching Facilities
IEEE Transactions on Systems, Man, and Cybernetics, Vol. 7, No. 8 | 1 Aug 1977
Cross Ref
Optimum low-thrust multiple rendezvous between inclined orbits
Acta Astronautica, Vol. 4, No. 5-6 | 1 May 1977
Cross Ref
Numerical methods for assembly-line balancing (survey)
Cybernetics, Vol. 13, No. 1 | 1 Jan 1977
Cross Ref
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness
Studies in Integer Programming | 1 Jan 1977
Cross Ref
Valid Inequalities, Covering Problems and Discrete Dynamic Programs
Studies in Integer Programming | 1 Jan 1977
Cross Ref
A dual algorithm for the one-machine scheduling problem
Mathematical Programming, Vol. 11, No. 1 | 1 Dec 1976
Cross Ref
Integer programming approaches to the travelling salesman problem
Mathematical Programming, Vol. 10, No. 1 | 1 December 1976
Cross Ref
Computergestützte Planungssysteme bei der Produktionsplanung
Computergestützte Planungssysteme | 1 Jan 1976
Cross Ref
Modelling Techniques and Heuristics for Combinatorial Problems
Combinatorial Programming: Methods and Applications | 1 Jan 1975
Cross Ref
An algorithm for scheduling parallel processors
International Journal of Production Research, Vol. 13, No. 5 | 24 October 2007
Cross Ref
Validation of subgradient optimization
Mathematical Programming, Vol. 6, No. 1 | 1 Dec 1974
Cross Ref
Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Naval Research Logistics Quarterly, Vol. 21, No. 3 | 21 November 2006
Cross Ref
An experimental comparison of solution algorithms for the single‐machine tardiness problem
Naval Research Logistics Quarterly, Vol. 21, No. 1 | 21 November 2006
Cross Ref
SCHEDULING JOBS ON PARALLEL PROCESSORS WITH DYNAMIC PROGRAMMING
Decision Sciences, Vol. 4, No. 4 | 7 June 2007
Cross Ref
Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
- Toshihide Ibaraki
SIAM Review, Vol. 15, No. 2 | 2 August 2006
Abstract PDF (772 KB)
Sequencing of interdependent hydroelectric projects
Water Resources Research, Vol. 9, No. 1 | 9 July 2010
Cross Ref
A heuristic approach to combinatorial optimization problems
5th Conference on Optimization Techniques Part I | 24 May 2005
Cross Ref
Diskussion der Modellwahl am Beispiel des Traveling-Salesman Problems
Branch and Bound: Eine Einführung | 1 Jan 1973
Cross Ref
Efficient Solution Procedures for Certain Scheduling and Sequencing Problems
Symposium on the Theory of Scheduling and Its Applications | 1 Jan 1973
Cross Ref
Selected Comments Concerning Optimization Techniques for Functions of Permutations
Symposium on the Theory of Scheduling and Its Applications | 1 Jan 1973
Cross Ref
Man-machine interactive transit system planning
Socio-Economic Planning Sciences, Vol. 6, No. 1 | 1 Feb 1972
Cross Ref
One problem in economics
Cybernetics, Vol. 5, No. 2 | 1 Jan 1972
Cross Ref
The traveling-salesman problem and minimum spanning trees: Part II
Mathematical Programming, Vol. 1, No. 1 | 1 Dec 1971
Cross Ref
BIBLIOGRAPHY
Elements of Combinatorial Computing | 1 Jan 1971
Cross Ref
Balancing Waste Collection Routes
Journal of Environmental Systems, Vol. 1, No. 4 | 1 Jan 1971
Cross Ref
A New Design Procedure for Traffic Signal Control Policies
IEEE Transactions on Systems Science and Cybernetics, Vol. 6, No. 4 | 1 Oct 1970
Cross Ref
A dynamic programming approach to dependent task clustering
ACM SIGMIS Database: the DATABASE for Advances in Information Systems, Vol. 2, No. 2 | 1 April 1970
Cross Ref
Heuristic Techniques for Solving Large Combinatorial Problems on a Computer
Theoretical Approaches to Non-Numerical Problem Solving | 1 Jan 1970
Cross Ref
Direct search algorithms for truck-dispatching problems
Transportation Research, Vol. 3, No. 1 | 1 Apr 1969
Cross Ref
Ordering problems
Cybernetics, Vol. 3, No. 2 | 1 Jan 1969
Cross Ref
The Distributed Processor Organization
Advances in Computers | 1 Jan 1969
Cross Ref
Sequencing theory – development to date
Naval Research Logistics Quarterly, Vol. 15, No. 2 | 29 October 2013
Cross Ref
Diskussion der Modellwahl am Beispiel des Traveling-Salesman Problems
Einführung in die Methode Branch and Bound | 1 Jan 1968
Cross Ref
Diskussion der Modellwahl am Beispiel des Traveling-Salesman Problems
Einführung in die Methode Branch and Bound | 1 Jan 1968
Cross Ref
A multi-period truck delivery problem
Transportation Research, Vol. 1, No. 4 | 1 Dec 1967
Cross Ref
Finite-State Processes and Dynamic Programming
- Richard M. Karp and
- Michael Held
SIAM Journal on Applied Mathematics, Vol. 15, No. 3 | 13 July 2006
Abstract PDF (2840 KB)
Simulating a production scheduling control system
IEEE Transactions on Automatic Control, Vol. 12, No. 1 | 1 Feb 1967
Cross Ref
Bibliography
Dynamic Programming Sequential Scientific Management | 1 Jan 1967
Cross Ref
Computer Solutions of the Traveling Salesman Problem
Bell System Technical Journal, Vol. 44, No. 10 | 29 July 2013
Cross Ref
Discrete Optimizing
- Stanley Reiter and
- Gordon Sherman
Journal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 3 | 13 July 2006
Abstract PDF (2288 KB)
Mathematical Programming
The American Mathematical Monthly, Vol. 72, No. sup2 | 5 February 2018
Cross Ref
A Comment on Minimum Feedback Arc Sets
IEEE Transactions on Circuit Theory, Vol. 11, No. 2 | 1 Jun 1964
Cross Ref

View Options

Purchase Save for later

Article Pay-Per-View $36.75 Add to cart

Access via your Institution
Questions about how to access this content? Contact SIAM at [email protected].

A Dynamic Programming Approach to Sequencing Problems

Get full access to this article

References

Information & Authors

Information

Published In

Copyright

History

Authors

Affiliations

Metrics & Citations

Metrics

Citations

Cited By

View Options

View options

PDF

Media

Figures

Other

Tables

PREVIOUS ARTICLE

NEXT ARTICLE

Browse

Browse

Alerts

Alerts

Information

Information

About

About

Verify Phone

Congrats!

Get full access to this article

References

Information

Published In

Copyright

History

Authors

Affiliations

Metrics

Citations

Cited By

View options

PDF

Figures

Other

Share

Copy the content Link

Share with email

Share on social media

Browse

Alerts

Information

About

Request Username

Register

Change Password

Your password must have 2 characters or more and contain 3 of the following:

Password Changed Successfully

Login

Verify Phone

Congrats!