A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Abstract
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting-plane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the incidence vectors of the hamiltonian cycles of a complete graph. The cuts are generated by several identification procedures that have been described in a companion paper. Whenever the cutting-plane procedure does not terminate with an optimal solution the algorithm uses a tree-search strategy that, as opposed to branch-and-bound, keeps on producing cuts after branching. The algorithm has been implemented in FORTRAN. Two different linear programming (LP) packages have been used as the LP solver. The implementation of the algorithm and the interface with one of the LP solvers is described in sufficient detail to permit the replication of our experiments. Computational results are reported with up to 42 STSPs with sizes ranging from 48 to 2,392 nodes. Most of the medium-sized test problems are taken from the literature; all others are large-scale real-world problems. All of the instances considered in this study were solved to optimality by the algorithm in “reasonable” computation times.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
J. R. Araque, Ph.D. Thesis, Contributions to the polyhedral approach to vehicle routing, SUNY at Stony Brook, Stony Brook, NY, 1989
2.
S. C. Boyd, W. H. Cunningham, Small traveling salesman polytopes, 1988, Preprint, Carleton University, Ottawa
3.
P. M. Camerini, L. Fratta, F. Maffioli, On improving relaxation methods by modified gradient techniques, Math. Programming Stud., (1975), 26–34
4.
N. Christofides, S. Eilon, An algorithm for the vehicle-dispatching problem, Oper. Res. Quart., 20 (1969), 309–318
5.
H. Crowder, M. Padberg, Solving large-scale symmetric travelling salesman problems to optimality, Management Sci., 26 (1980), 495–509
6.
G. B. Dantzig, D. R. Fulkerson, S. M. Johnson, Solution of a large-scale traveling-salesman problem, J. Operations Res. Soc. Amer., 2 (1954), 393–410
7.
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
8.
Robert S. Garfinkel, George L. Nemhauser, Integer programming, Wiley-Interscience [John Wiley & Sons], New York, 1972xiv+427
9.
B. E. Gillett, J. G. Johnson, Multi-terminal vehicle-dispatch algorithm, Omega, 4 (1976), 711–718
10.
Martin Grötschel, Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme, Verlag Anton Hain, Meisenheim am Glan, 1977iv+305, FRG
11.
Martin Grötschel, On the symmetric travelling salesman problem: solution of a $120$-city problem, Math. Programming Stud., (1980), 61–77
12.
M. Grötschel, O. Holland, Solution of large-scale symmetric travelling salesman problems, Report, 73, Institut für Mathematik, Universität Augsburg, Augsburg, FRG., 1988
13.
M. Grötschel, L. Lovász, A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), 169–197
14.
M. Grötschel, M. Padberg, On the symmetric travelling salesman problem: theory and computationOptimization and operations research (Proc. Workshop, Univ. Bonn, Bonn, 1977), Lecture Notes in Econom. and Math. Systems, Vol. 157, Springer, Berlin, 1978, 105–115
15.
Martin Grötschel, Manfred W. Padberg, On the symmetric travelling salesman problem. I. Inequalities, Math. Programming, 16 (1979), 265–280
16.
M. Grötschel, M. Padberg, On the symmetric travelling salesman problem. II. Lifting theorems and facets, Math. Programming, 16 (1979), 281–302
17.
M. Grötschel, M. Padberg, E. L. Lawler, Polyhedral theoryThe traveling salesman problem, Wiley-Intersci. Ser. Discrete Math., Wiley, Chichester, 1985, 251–305, UK
18.
M. Grötschel, W. R. Pulleyblank, Clique tree inequalities and the symmetric travelling salesman problem, Math. Oper. Res., 11 (1986), 537–569
19.
Keld Helbig Hansen, Jakob Krarup, Improvements of the Held-Karp algorithm for the symmetric traveling-salesman problem, Math. Programming, 7 (1974), 87–96
20.
Michael Held, Richard M. Karp, The traveling-salesman problem and minimum spanning trees. II, Math. Programming, 1 (1971), 6–25
21.
A. J. Hoffman, P. Wolfe, E. L. Lawler, HistoryThe traveling salesman problem, Wiley-Intersci. Ser. Discrete Math., Wiley, Chichester, 1985, 1–15, UK
22.
K. Hoffman, M. Padberg, LP-based combinatorial problem solving, Ann. Oper. Res., 4 (1985), 145–194
23.
P. D. Krolak, W. Felts, J. H. Nelson, A man-machine approach towards solving the traveling salesman problem, Comm. ACM, 14 (1971), 327–334
24.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The traveling salesman problem, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons Ltd., Chichester, 1985x+465, UK
25.
T. G. Lewis, W. H. Payne, Generalized feedback shift register pseudorandom number algorithm, J. Assoc. Comput. Mach., 20 (1973), 456–468
26.
S. Lin, B. W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem, Operations Res., 21 (1973), 498–516
27.
R. Marsten, The design of the XMP linear programming library, ACM Trans. Math. Soft-ware, 7 (1981), 481–497
28.
P. Miliotis, Using cutting planes to solve the symmetric traveling salesman problem, Math. Programming, 15 (1978), 177–188
29.
Denis Naddef, Giovanni Rinaldi, The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities, Math. Programming, 51 (1991), 359–400
30.
Denis Naddef, Giovanni Rinaldi, The graphical relaxation: a new framework for the symmetric traveling salesman polytope, Math. Programming, 58 (1993), 53–88
31.
D. Naddef, G. Rinaldi, The symmetric traveling salesman polytope: New facets from the graphical relaxation, Report, R.248, IASI-CNR, Rome, 1988c
32.
D. Naddef, G. Rinaldi, The crown inequalities for the symmetric traveling salesman polytope, Math. Oper. Res., 17 (1992), 308–326
33.
George L. Nemhauser, Laurence A. Wolsey, Integer and combinatorial optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., New York, 1988xvi+763
34.
M. Padberg, A note on the convergence of integer programming algorithms using intersection cuts, 1973, Mimeo 1970,Preprint 1/73–46, Internat. Inst. of Management, Berlin
35.
M. Padberg, Ph.D. Thesis, Essays in integer programming, GSIA,Carnegie-Mellon University, Pittsburgh, PA, 1971
36.
M. Padberg, On the facial structure of set packing polyhedra, Math. Programming, 5 (1973), 199–215
37.
M. Padberg, M. Grötschel, E. L. Lawler, Polyhedral computationsThe traveling salesman problem, Wiley-Intersci. Ser. Discrete Math., Wiley, Chichester, 1985, 307–360, UK
38.
M. Padberg, Saman Hong, On the symmetric travelling salesman problem: a computational study, Math. Programming Stud., (1980), 78–107
39.
M. Padberg, M. R. Rao, The Russian method for linear inequalities III: bounded integer programming, GBA Report, 81–39, New York University, New York, 1981
40.
M. Padberg, M. R. Rao, Odd minimum cut-sets and b-matchings, Math. Oper. Res., 7 (1982), 67–80
41.
M. Padberg, G. Rinaldi, Optimization of a $532$-city symmetric traveling salesman problem by branch and cut, Oper. Res. Lett., 6 (1987), 1–7
42.
M. Padberg, G. Rinaldi, A branch-and-cut approach to a traveling salesman problem with side constraints, Management Sci., 35 (1989), 1393–1412
43.
Manfred Padberg, Giovanni Rinaldi, Facet identification for the symmetric traveling salesman polytope, Math. Programming, 47 (1990), 219–257
44.
M. Padberg, G. Rinaldi, An efficient algorithm for the minimum capacity cut problem, Math. Programming, 47 (1990), 19–36
45.
G. Rinaldi, L. A. Yarrow, Optimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving, GBA Report, 85–42, New York University, New York, 1985
46.
A. E. Story, H. M. Wagner, J. F. Muth, G. F. Thomson, Computational experience with integer programming for job-shop schedulingIndustrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ, 1963, 207–219
47.
C. A. Trauth, Jr., R. E. Woolsey, Integer programming: A study in computational efficiency, Management Sci., 15 (1969), 481–493
48.
H. M. Wagner, R. J. Giglio, R. G. Glaser, Preventive maintenance scheduling by mathematical programming, Management Sci., 10 (1964), 316–334
49.
H. Weyl, Elementare Theorie der konvexen Polyeder, Commentarii Mathematici Helvetici, 7 (1935), 509–533
Information & Authors
Information
Published In
Copyright
Copyright © 1991 Society for Industrial and Applied Mathematics.
History
Submitted: 24 April 1989
Accepted: 7 June 1990
Published online: 18 July 2006
MSC codes
Keywords
Authors
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
-
A compact time horizon compression method for planning community integrated energy systems with long-term energy storage Applied Energy, Vol. 361 | 1 May 2024
-
Shore hydrogen deployment problem in green ports Computers & Operations Research, Vol. 165 | 1 May 2024
-
A comparison of alternative models for solving a non-linear single plant Hydro Unit Commitment problem Computers & Operations Research, Vol. 165 | 1 May 2024
-
Optimization of E-bike networks Transportation Planning and Technology | 9 April 2024
-
A new formulation and a branch-and-cut algorithm for the set orienteering problem European Journal of Operational Research, Vol. 314, No. 2 | 1 Apr 2024
-
Solution Strategies Model‐Based Optimization for Petroleum Refinery Configuration Design | 29 December 2023
-
Operational Research: methods and applications Journal of the Operational Research Society, Vol. 75, No. 3 | 27 December 2023
-
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem Expert Systems with Applications, Vol. 238 | 1 Mar 2024
-
A Benders decomposition approach for planning home blood donations Flexible Services and Manufacturing Journal, Vol. 2 | 20 February 2024
-
A Variational Neural Architecture for Skill-based Team Formation ACM Transactions on Information Systems, Vol. 42, No. 1 | 18 August 2023
-
Mechanisms for feasibility and improvement for inventory-routing problems Journal of the Operational Research Society, Vol. 75, No. 1 | 6 February 2023
-
Analysis of the Attractor-Based Search System The Traveling Salesman Problem | 9 July 2023
-
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem Computers & Operations Research, Vol. 161 | 1 Jan 2024
-
The inventory routing problem with split deliveries Networks, Vol. 82, No. 4 | 12 July 2023
-
Decomposition-Based Lin–Kernighan Heuristic With Neighborhood Structure Transfer for Multi/Many-Objective Traveling Salesman Problem IEEE Transactions on Evolutionary Computation, Vol. 27, No. 6 | 1 Dec 2023
-
A review of classical methods and Nature-Inspired Algorithms (NIAs) for optimization problems Results in Control and Optimization, Vol. 13 | 1 Dec 2023
-
Improved formulations of the joint order batching and picker routing problem International Journal of Production Research, Vol. 61, No. 21 | 26 November 2022
-
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem Journal of Global Optimization, Vol. 87, No. 1 | 10 January 2023
-
Reliability-Oriented Planning Framework for Smart Cities: From Interconnected Micro Energy Hubs to Macro Energy Hub Scale IEEE Systems Journal, Vol. 17, No. 3 | 1 Sep 2023
-
Co-design optimization of combined heat and power-based microgrids Journal of Renewable and Sustainable Energy, Vol. 15, No. 5 | 16 October 2023
-
Cutting-plane algorithms for preemptive uniprocessor scheduling problems Real-Time Systems, Vol. 8 | 28 August 2023
-
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems Transportation Science | 16 August 2023
-
TSP review: performance comparison of the well-known methods on a standardized dataset 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS) | 14 Aug 2023
-
The simultaneous semi-random model for TSP Mathematical Programming, Vol. 45 | 11 August 2023
-
The follower optimality cuts for mixed integer linear bilevel programming problems Soft Computing, Vol. 27, No. 16 | 25 May 2023
-
Solving Linear Integer Models with Variable Bounding Forecasting, Vol. 5, No. 2 | 5 May 2023
-
On the generation of metric TSP instances with a large integrality gap by branch-and-cut Mathematical Programming Computation, Vol. 15, No. 2 | 27 March 2023
-
Flexible scheduling of diagnostic tests in automotive manufacturing Flexible Services and Manufacturing Journal, Vol. 35, No. 2 | 16 January 2022
-
An efficient scenario penalization matheuristic for a stochastic scheduling problem Journal of Heuristics, Vol. 29, No. 2-3 | 29 May 2023
-
Integer programming formulations for the k ‐ in‐a‐tree problem in graphs International Transactions in Operational Research, Vol. 44 | 14 April 2023
-
Mind the gap: a review of optimisation in mental healthcare service delivery Health Systems, Vol. 12, No. 2 | 12 March 2022
-
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem Computers & Operations Research, Vol. 26 | 1 Apr 2023
-
The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms Computers & Industrial Engineering, Vol. 90 | 1 Apr 2023
-
Efficient Test Chip Design via Smart Computation ACM Transactions on Design Automation of Electronic Systems, Vol. 28, No. 2 | 22 March 2023
-
Prioritizing Irrigation‐System Upgrades to Maximize Improvements to Agricultural Drain‐Network Water Quality: A Graph‐Theoretic Approach Water Resources Research, Vol. 59, No. 3 | 16 March 2023
-
Topologically Ordered Self Organizing Map for Optimal Allocation of Urban Emergency Mobile Power Supply Proceedings of 2021 5th Chinese Conference on Swarm Intelligence and Cooperative Control | 29 July 2022
-
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities INFORMS Journal on Computing, Vol. 35, No. 1 | 1 Jan 2023
-
Linear Programming Approach to Relative-Orbit Control With Element-Wise Quantized Control IEEE Control Systems Letters, Vol. 7 | 1 Jan 2023
-
Mixed-Integer Programming Models for Two Metal Additive Manufacturing Methods Mathematical Methods for Objects Reconstruction | 11 April 2023
-
List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem Computer Science and Education in Computer Science | 11 October 2023
-
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning Learning and Intelligent Optimization | 25 October 2023
-
Ranking constraint relaxations for mixed integer programs using a machine learning approach EURO Journal on Computational Optimization, Vol. 11 | 1 Jan 2023
-
Handling Complexity in Large-Scale Cyber-Physical Systems Through Distributed Computation Computation-Aware Algorithmic Design for Cyber-Physical Systems | 25 August 2023
-
Differential Cryptanalysis with SAT, SMT, MILP, and CP: A Detailed Comparison for Bit-Oriented Primitives Cryptology and Network Security | 31 October 2023
-
Correlation-Diversified Portfolio Construction by Finding Maximum Independent Set in Large-Scale Market Graph IEEE Access, Vol. 11 | 1 Jan 2023
-
Neuro-Ising: Accelerating Large-Scale Traveling Salesman Problems via Graph Neural Network Guided Localized Ising Solvers IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 41, No. 12 | 1 Dec 2022
-
Vehicle Rescheduling with Delivery Delay Considering Perceived Waiting Cost of Heterogeneous Customers Processes, Vol. 10, No. 12 | 8 December 2022
-
Collaborative optimization by shared objective function data Array, Vol. 16 | 1 Dec 2022
-
Comparison of formulations for the Inventory Routing Problem European Journal of Operational Research, Vol. 303, No. 3 | 1 Dec 2022
-
The Lean-Branch-and-Bound Structure Effectiveness in Enhancing the Logistic Stowage Methodology for the Regular Shapes Processes, Vol. 10, No. 11 | 1 November 2022
-
Multi-Area Complete Coverage with Fixed-Wing UAV Swarms Based on Modified Ant Colony Algorithm 2022 IEEE International Conference on Unmanned Systems (ICUS) | 28 Oct 2022
-
Multi-Objective Gate Allocation Problem Based on Multi-Commodity Network Flow Model Applied Sciences, Vol. 12, No. 19 | 30 September 2022
-
Mean field approximation for solving QUBO problems PLOS ONE, Vol. 17, No. 8 | 30 August 2022
-
An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem 2022 IEEE Congress on Evolutionary Computation (CEC) | 18 Jul 2022
-
A Two-Phase, Joint-Commuting Model for Primary and Secondary Schools Considering Parking Sharing International Journal of Environmental Research and Public Health, Vol. 19, No. 11 | 25 May 2022
-
OPR: SDN-based Optimal Path Routing within Transit Autonomous System Networks ICC 2022 - IEEE International Conference on Communications | 16 May 2022
-
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
-
A Scalable Algorithm for Sparse Portfolio Selection INFORMS Journal on Computing, Vol. 34, No. 3 | 1 May 2022
-
Synthesis of Frame Field-Aligned Multi-Laminar Structures ACM Transactions on Graphics, Vol. 11 | 24 February 2022
-
Multilevel asymptotic-preserving Monte Carlo for kinetic-diffusive particle simulations of the Boltzmann-BGK equation Journal of Computational Physics, Vol. 450 | 1 Feb 2022
-
Reluplex: a calculus for reasoning about deep neural networks Formal Methods in System Design, Vol. 60, No. 1 | 1 July 2021
-
Methodology of Solving Selected Routing Problems Graph-Based Modelling in Science, Technology and Art | 2 August 2021
-
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
-
Using Linear Programming for Builder Brigades Optimization Proceedings of the 5th International Conference on Construction, Architecture and Technosphere Safety | 2 March 2022
-
The Boolean Quadric Polytope The Quadratic Unconstrained Binary Optimization Problem | 9 April 2022
-
The Simultaneous Semi-random Model for TSP Integer Programming and Combinatorial Optimization | 27 May 2022
-
Personalized Extractive Summarization with Discourse Structure Constraints Towards Efficient and Coherent Dialog-Based News Delivery Conversational AI for Natural Human-Centric Interaction | 1 November 2022
-
Nonlinear chance-constrained problems with applications to hydro scheduling Mathematical Programming, Vol. 191, No. 1 | 14 November 2019
-
Optimizing the daily use of limited solar panels in closely located rural schools in Zimbabwe Advances of Artificial Intelligence in a Green Energy Environment | 1 Jan 2022
-
VizLinter: A Linter and Fixer Framework for Data Visualization IEEE Transactions on Visualization and Computer Graphics, Vol. 28, No. 1 | 1 Jan 2022
-
A partitioning column approach for solving LED sorter manipulator path planning problems Journal of Industrial and Management Optimization, Vol. 18, No. 3 | 1 Jan 2022
-
Unbiasing in Iterative Reconstruction Algorithms for Discrete Compressed Sensing Compressed Sensing in Information Processing | 21 October 2022
-
Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection Expert Systems with Applications, Vol. 187 | 1 Jan 2022
-
Simultaneous Stochastic Optimization of a Mining Complex with Preconcentration Using Reinforcement Learning SSRN Electronic Journal, Vol. 40 | 1 Jan 2022
-
Reducing the complexity of the knapsack linear integer problem by reformulation techniques International Journal of System Assurance Engineering and Management, Vol. 12, No. 6 | 1 September 2021
-
KTSP Solution Based on Workload Balance and Genetic 2021 20th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES) | 1 Dec 2021
-
Automated decision support methodology for early planning phase of a multi-reservoir field Journal of Petroleum Science and Engineering, Vol. 205 | 1 Oct 2021
-
Kohonen Self-Organizing Map based Route Planning: A Revisit 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) | 27 Sep 2021
-
Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice Journal of Global Optimization, Vol. 81, No. 1 | 24 May 2021
-
Robust multi-product newsvendor model with uncertain demand and substitution European Journal of Operational Research, Vol. 293, No. 1 | 1 Aug 2021
-
A Data-Driven Based Dynamic Rebalancing Methodology for Bike Sharing Systems Applied Sciences, Vol. 11, No. 15 | 28 July 2021
-
The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms Computational Geometry, Vol. 97 | 1 Aug 2021
-
Vessel routing optimization for floating macro-marine debris collection in the ocean considering dynamic velocity and direction Transportation Research Part E: Logistics and Transportation Review, Vol. 152 | 1 Aug 2021
-
A Novel Integer Linear Programming Formulation for Job-Shop Scheduling Problems IEEE Robotics and Automation Letters, Vol. 6, No. 3 | 1 Jul 2021
-
Model and exact solution for a two-echelon inventory routing problem International Journal of Production Research, Vol. 59, No. 10 | 27 March 2020
-
Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation European Journal of Operational Research, Vol. 290, No. 3 | 1 May 2021
-
Vehicle routing on road networks: How good is Euclidean approximation? Computers & Operations Research, Vol. 129 | 1 May 2021
-
References Optimizations and Programming | 28 April 2021
-
A column-and-row generation approach for the flying sidekick travelling salesman problem Transportation Research Part C: Emerging Technologies, Vol. 124 | 1 Mar 2021
-
The Fixed-Partition Policy Inventory Routing Problem Transportation Science, Vol. 55, No. 2 | 1 Mar 2021
-
On the scalability of battery‐aware contact plan design for LEO satellite constellations International Journal of Satellite Communications and Networking, Vol. 39, No. 2 | 20 August 2020
-
TinyLink ACM Transactions on Sensor Networks, Vol. 17, No. 1 | 27 September 2020
-
Modified ant colony optimization with improved tour construction and pheromone updating strategies for traveling salesman problem Soft Computing, Vol. 25, No. 4 | 22 October 2020
-
Strong IP formulations need large coefficients Discrete Optimization, Vol. 39 | 1 Feb 2021
-
Personalized Extractive Summarization for a News Dialogue System 2021 IEEE Spoken Language Technology Workshop (SLT) | 19 Jan 2021
-
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints SIAM Journal on Optimization, Vol. 31, No. 3 | 28 September 2021
-
Solving an Integer Program by Using the Nonfeasible Basis Method Combined with the Cutting Plane Method Intelligent Computing and Optimization | 8 February 2021
-
Branch Cut and Free Algorithm for the General Linear Integer Problem Intelligent Computing and Optimization | 8 February 2021
-
Solving Inventory Routing Problems with the Gurobi Branch-and-Cut Algorithm Optimization and Learning | 17 August 2021
-
Facets from gadgets Mathematical Programming, Vol. 185, No. 1-2 | 14 September 2019
-
Consistent recovery threshold of hidden nearest neighbor graphs IEEE Transactions on Information Theory | 1 Jan 2021
-
Adaptive Control for Energy Exchange with Probabilistic Interval Predictors in Isolated Microgrids Energies, Vol. 14, No. 2 | 12 January 2021
-
Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem Research Advancements in Smart Technology, Optimization, and Renewable Energy | 1 Jan 2021
-
The Traveling Salesman Problem Research Advancements in Smart Technology, Optimization, and Renewable Energy | 1 Jan 2021
-
The two-echelon production-routing problem European Journal of Operational Research, Vol. 288, No. 2 | 1 Jan 2021
-
Computational Intelligence and Combinatorial Optimization Problems in Transportation Science Advances in Core Computer Science-Based Technologies | 19 June 2020
-
UAV‐Enabled Wireless Power Transfer UAV Communications for 5G and Beyond | 11 December 2020
-
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms Soft Computing, Vol. 24, No. 23 | 7 June 2020
-
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation Mathematical Programming Computation, Vol. 12, No. 4 | 26 June 2020
-
Optimization in waste landfilling partitioning in Paraná State, Brazil Journal of Cleaner Production | 1 Dec 2020
-
A variable MIP neighborhood descent for the multi-attribute inventory routing problem Transportation Research Part E: Logistics and Transportation Review, Vol. 144 | 1 Dec 2020
-
Flexible Route Optimization for Demand-Responsive Public Transit Service Journal of Transportation Engineering, Part A: Systems, Vol. 146, No. 12 | 1 Dec 2020
-
Automated Test Assembly for Large-Scale Standardized Assessments: Practical Issues and Possible Solutions Psych, Vol. 2, No. 4 | 25 November 2020
-
A multi-objective bi-level location problem for heterogeneous sensor networks with hub-spoke topology Computer Networks, Vol. 181 | 1 Nov 2020
-
References Integer Programming | 19 September 2020
-
Multi-Regional Coverage Path Planning for Robots with Energy Constraint 2020 IEEE 16th International Conference on Control & Automation (ICCA) | 9 Oct 2020
-
Secure traveling salesman problem with intelligent transport systems features Logic Journal of the IGPL, Vol. 21 | 8 September 2020
-
Outer-product-free sets for polynomial optimization and oracle-based cuts Mathematical Programming, Vol. 183, No. 1-2 | 28 February 2020
-
On matroid parity and matching polytopes Discrete Applied Mathematics, Vol. 284 | 1 Sep 2020
-
Improving the performance of solving large scale mixed-integer energy system models by applying the fix-and-relax method 2020 17th International Conference on the European Energy Market (EEM) | 1 Sep 2020
-
A Unit Commitment Algorithm With Relaxation-Based Neighborhood Search and Improved Relaxation Inducement IEEE Transactions on Power Systems, Vol. 35, No. 5 | 1 Sep 2020
-
The two-echelon inventory-routing problem with fleet management Computers & Operations Research, Vol. 121 | 1 Sep 2020
-
Vessel routing and optimization for marine debris collection with consideration of carbon cap Journal of Cleaner Production, Vol. 263 | 1 Aug 2020
-
Order batching using an approximation for the distance travelled by pickers European Journal of Operational Research, Vol. 284, No. 2 | 1 Jul 2020
-
A mathematical model for supply chain management of blood banks in India OPSEARCH, Vol. 57, No. 2 | 18 November 2019
-
Probabilistic Microgrid Energy Management with Interval Predictions Energies, Vol. 13, No. 12 | 16 June 2020
-
A hybridized parallel bats algorithm for combinatorial problem of traveling salesman Journal of Intelligent & Fuzzy Systems, Vol. 38, No. 5 | 29 May 2020
-
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries European Journal of Operational Research, Vol. 282, No. 3 | 1 May 2020
-
A branch-and-cut algorithm for an assembly routing problem European Journal of Operational Research, Vol. 282, No. 3 | 1 May 2020
-
Decision support method for early-phase design of offshore hydrocarbon fields using model-based optimization Journal of Petroleum Exploration and Production Technology, Vol. 10, No. 4 | 4 December 2019
-
Multi-objective optimal sizing of grid connected photovoltaic batteryless system minimizing the total life cycle cost and the grid energy Renewable Energy, Vol. 148 | 1 Apr 2020
-
A Tutorial on Clique Problems in Communications and Signal Processing Proceedings of the IEEE, Vol. 108, No. 4 | 1 Apr 2020
-
Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity Intelligent Computing and Optimization | 27 October 2019
-
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope Combinatorial Optimization and Applications | 4 December 2020
-
Exact algorithms for solving rich vehicle routing problems Smart Delivery Systems | 1 Jan 2020
-
On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art Smart Delivery Systems | 1 Jan 2020
-
Optimal transportation planning of classified domestic garbage based on map distance Journal of Environmental Management, Vol. 254 | 1 Jan 2020
-
Path Planning for UAV to Cover Multiple Separated Convex Polygonal Regions IEEE Access, Vol. 8 | 1 Jan 2020
-
The Charging Strategy of Mobile Charging Vehicles in Wireless Rechargeable Sensor Networks With Heterogeneous Sensors IEEE Access, Vol. 8 | 1 Jan 2020
-
Ordinal-Optimization Concept Enabled Decomposition and Coordination of Mixed-Integer Linear Programming Problems IEEE Robotics and Automation Letters | 1 Jan 2020
-
Modeling and solving the angular constrained minimum spanning tree problem Computers & Operations Research, Vol. 112 | 1 Dec 2019
-
Optimal storage and loading zones within surface parking facilities for privately owned automated vehicles IET Intelligent Transport Systems, Vol. 13, No. 12 | 29 August 2019
-
Customized bus routing problem with time window restrictions: model and case study Transportmetrica A: Transport Science, Vol. 15, No. 2 | 25 July 2019
-
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design Computers & Operations Research, Vol. 111 | 1 Nov 2019
-
Trade-offs between environmental and economic performance in production and inventory-routing problems International Journal of Production Economics, Vol. 217 | 1 Nov 2019
-
IPSA: Integer Programming via Sparse Approximation for Efficient Test-Chip Design 2019 IEEE 37th International Conference on Computer Design (ICCD) | 1 Nov 2019
-
Improving TSP Tours Using Dynamic Programming over Tree Decompositions ACM Transactions on Algorithms, Vol. 15, No. 4 | 4 October 2019
-
A Renewable Charging Approach with Low Energy Consumption in Wireless Sensor Networks 2019 IEEE 19th International Conference on Communication Technology (ICCT) | 1 Oct 2019
-
Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models International Journal of Mathematical, Engineering and Management Sciences, Vol. 4, No. 5 | 1 October 2019
-
Which Local Search Operator Works Best for the Open-Loop TSP? Applied Sciences, Vol. 9, No. 19 | 23 September 2019
-
Continuous relaxations for the traveling salesman problem Nonlinear Dynamics, Vol. 97, No. 4 | 15 July 2019
-
Core group placement: allocation and provisioning of heterogeneous resources EURO Journal on Computational Optimization, Vol. 7, No. 3 | 1 Sep 2019
-
A Charging Algorithm for the Wireless Rechargeable Sensor Network with Imperfect Charging Channel and Finite Energy Storage Sensors, Vol. 19, No. 18 | 9 September 2019
-
References Fundamentals of Supply Chain Theory | 28 June 2019
-
Planning TS Trajectory Using MLAT in $\mathrm{o}(\mathrm{n}\log \mathrm{n})$ 2019 12th International Workshop on Robot Motion and Control (RoMoCo) | 1 Jul 2019
-
Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics Transportation Research Part E: Logistics and Transportation Review, Vol. 126 | 1 Jun 2019
-
An Optimized Cost Flow Algorithm to Spread Cells in Detailed Placement ACM Transactions on Design Automation of Electronic Systems, Vol. 24, No. 3 | 1 Jun 2019
-
Shared-Memory Exact Minimum Cuts 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2019
-
Robust Control of a Microgrid Energy Storage System Using Various Approaches IEEE Transactions on Smart Grid, Vol. 10, No. 3 | 1 May 2019
-
Generator Maintenance Scheduling Method Using Transformation of Mixed Integer Polynomial Programming in a Power System Incorporating Demand Response Energies, Vol. 12, No. 9 | 30 April 2019
-
A layered compact formulation for the Multiple Steiner TSP with Order constraints 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT) | 1 Apr 2019
-
A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation IEEE Transactions on Automation Science and Engineering, Vol. 16, No. 2 | 1 Apr 2019
-
Feasibility Pump Algorithm for Sparse Representation under Laplacian Noise Mathematical Problems in Engineering, Vol. 2019 | 24 Feb 2019
-
Layered graph approaches for combinatorial optimization problems Computers & Operations Research, Vol. 102 | 1 Feb 2019
-
The p-arborescence star problem: Formulations and exact solution approaches Computers & Operations Research, Vol. 102 | 1 Feb 2019
-
Scalable computation of high-order optimization queries Communications of the ACM, Vol. 62, No. 2 | 28 January 2019
-
The Inmate Transportation Problem and Its Application in the PA Department of Corrections Advances in Service Science | 29 December 2018
-
A Unified Comparative Study of Heuristic Algorithms for Double Combinatorial Auctions: Locality-Constrained Resource Allocation Problems Agents and Artificial Intelligence | 30 December 2018
-
Hybrid Genetic Algorithm for CSOP to Find the Lowest Hamiltonian Circuit in a Superimposed Graph Artificial Intelligence and Soft Computing | 27 May 2019
-
Effective Algorithm of Simulated Annealing for the Symmetric Traveling Salesman Problem Contemporary Complex Systems and Their Dependability | 27 May 2018
-
The two-echelon multi-depot inventory-routing problem Computers & Operations Research, Vol. 101 | 1 Jan 2019
-
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph RAIRO - Operations Research, Vol. 53, No. 1 | 15 February 2019
-
A Novel Online Scheduling Algorithm and Hierarchical Protocol for Large-Scale EV Charging Coordination IEEE Access, Vol. 7 | 1 Jan 2019
-
Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem Proceedings of the 2019 5th International Conference on Industrial and Business Engineering - ICIBE 2019 | 1 Jan 2019
-
Computing in Combinatorial Optimization Computing and Software Science | 5 October 2019
-
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
-
Practical Minimum Cut Algorithms ACM Journal of Experimental Algorithmics, Vol. 23 | 1 October 2018
-
Comparison of optimization solvers in the model predictive control of a PV-battery-heat pump system Energy Procedia, Vol. 155 | 1 Nov 2018
-
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem European Journal of Operational Research, Vol. 271, No. 1 | 1 Nov 2018
-
Route Design Problem of Customized Buses: Mixed Integer Programming Model and Case Study Journal of Transportation Engineering, Part A: Systems, Vol. 144, No. 11 | 1 Nov 2018
-
Package queries: efficient and scalable computation of high-order constraints The VLDB Journal, Vol. 27, No. 5 | 24 October 2017
-
Joint design of fleet size, hub locations, and hub capacities for third-party logistics networks with road congestion constraints Transportation Research Part E: Logistics and Transportation Review, Vol. 118 | 1 Oct 2018
-
Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions Physical Review E, Vol. 98, No. 3 | 27 September 2018
-
Optimal Multi-Way Number Partitioning Journal of the ACM, Vol. 65, No. 4 | 25 July 2018
-
UAV-Enabled Wireless Power Transfer: Trajectory Design and Energy Optimization IEEE Transactions on Wireless Communications, Vol. 17, No. 8 | 1 Aug 2018
-
Analysis of optimal piece flow in tit-for-tat-based P2P streaming Computer Networks, Vol. 139 | 1 Jul 2018
-
Inventory routing with pickups and deliveries European Journal of Operational Research, Vol. 268, No. 1 | 1 Jul 2018
-
rEMpy: a comprehensive software framework for residential energy management Energy and Buildings, Vol. 171 | 1 Jul 2018
-
Multi-UAV Pre-Positioning and Routing for Power Network Damage Assessment IEEE Transactions on Smart Grid, Vol. 9, No. 4 | 1 Jul 2018
-
A comprehensive review of quadratic assignment problem: variants, hybrids and applications Journal of Ambient Intelligence and Humanized Computing, Vol. 10 | 20 June 2018
-
A hybrid approach for biobjective optimization Discrete Optimization, Vol. 28 | 1 May 2018
-
Optimal Purchase Strategy for Demand Bidding IEEE Transactions on Power Systems, Vol. 33, No. 3 | 1 May 2018
-
YAPAY ZEKA VE KÜMELEME TEKNİKLERİ KULLANILARAK GELİŞTİRİLEN YÖNTEM İLE OKUL SERVİSİ ROTALAMA PROBLEMİNİN OPTİMİZASYONU Mühendislik Bilimleri ve Tasarım Dergisi, Vol. 6, No. 1 | 23 March 2018
-
A minimum spanning tree based heuristic for the travelling salesman tour OPSEARCH, Vol. 55, No. 1 | 9 May 2017
-
A general system for heuristic minimization of convex functions over non-convex sets Optimization Methods and Software, Vol. 33, No. 1 | 10 April 2017
-
Strategic Form Games on Digraphs Pareto-Nash-Stackelberg Game and Control Theory | 10 March 2018
-
Methodology: Preliminaries and Background Equipment Selection for Mining: With Case Studies | 3 March 2018
-
Review of Basic Local Searches for Solving the Minimum Sum-of-Squares Clustering Problem Open Problems in Optimization and Data Analysis | 4 December 2018
-
The Nearest Neighbor Ant Colony System: A Spatially-Explicit Algorithm for the Traveling Salesman Problem Spatial Analysis and Location Modeling in Urban and Regional Systems | 2 December 2017
-
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem OR Spectrum, Vol. 40, No. 1 | 12 November 2017
-
References Operations Management in Agriculture | 1 Jan 2018
-
Capacity Impacts and Optimal Geometry of Automated Cars’ Surface Parking Facilities Journal of Advanced Transportation, Vol. 2018 | 1 Jan 2018
-
A discussion of objective function representation methods in global optimization Frontiers of Engineering Management, Vol. 5, No. 4 | 1 Jan 2018
-
Robust Multi-Product Newsvendor Model With Substitution Under Cardinality-Constrained Uncertainty Set SSRN Electronic Journal, Vol. 4 | 1 Jan 2018
-
An Efficient Digital Background Control for Hybrid Transformer-Based Receivers IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 64, No. 12 | 1 Dec 2017
-
Solving the large-scale knapsack feasibility problem using a distributed computation approach to integer programming Applied Informatics, Vol. 4, No. 1 | 20 December 2017
-
UAV-enabled multiuser wireless power transfer: Trajectory design and energy optimization 2017 23rd Asia-Pacific Conference on Communications (APCC) | 1 Dec 2017
-
Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries Operations Research, Vol. 65, No. 6 | 1 Dec 2017
-
Order picking problems under weight, fragility and category constraints International Journal of Production Research, Vol. 55, No. 21 | 27 October 2016
-
Optimally solving the joint order batching and picker routing problem European Journal of Operational Research, Vol. 262, No. 3 | 1 Nov 2017
-
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem European Journal of Operational Research, Vol. 262, No. 3 | 1 Nov 2017
-
A dual local search framework for combinatorial optimization problems with TSP application Journal of the Operational Research Society, Vol. 68, No. 11 | 21 December 2017
-
Near optimal linear-service oriented resource allocation strategy for LTE networks 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) | 1 Nov 2017
-
On global integer extrema of real-valued box-constrained multivariate quadratic functions Journal of Combinatorial Optimization, Vol. 34, No. 3 | 18 March 2017
-
Unsupervised Video Understanding by Reconciliation of Posture Similarities 2017 IEEE International Conference on Computer Vision (ICCV) | 1 Oct 2017
-
On facet-inducing inequalities for combinatorial polytopes Journal of Applied and Industrial Mathematics, Vol. 11, No. 4 | 26 November 2017
-
A Variable MIP Neighborhood Descent algorithm for managing inventory and distribution of cash in automated teller machines Computers & Operations Research, Vol. 85 | 1 Sep 2017
-
A Matheuristic for the Multivehicle Inventory Routing Problem INFORMS Journal on Computing, Vol. 29, No. 3 | 1 Aug 2017
-
On learning and branching: a survey TOP, Vol. 25, No. 2 | 13 June 2017
-
A new open-source Energy Management framework: Functional description and preliminary results 2017 IEEE Congress on Evolutionary Computation (CEC) | 1 Jun 2017
-
Adopting Sector-Based Replacement (SBR) and Utilizing Air-R to Achieve R-WSN Sustainability Information, Vol. 8, No. 2 | 21 June 2017
-
An exact penalty function method for optimising QAP formulation in facility layout problem International Journal of Production Research, Vol. 55, No. 10 | 1 September 2016
-
A Scalable Execution Engine for Package Queries ACM SIGMOD Record, Vol. 46, No. 1 | 12 May 2017
-
A parallel domain decomposition algorithm for coastal ocean circulation models based on integer linear programming Ocean Dynamics, Vol. 67, No. 5 | 1 April 2017
-
The probabilistic orienteering problem Computers & Operations Research, Vol. 81 | 1 May 2017
-
The Traveling Purchaser Problem and its variants European Journal of Operational Research, Vol. 259, No. 1 | 1 May 2017
-
Computationally Tractable Formulations for Optimal Path Planning with Interception of Targets’ Neighborhoods Journal of Guidance, Control, and Dynamics, Vol. 40, No. 5 | 1 May 2017
-
Novel approaches for portfolio construction using second order stochastic dominance Computational Management Science, Vol. 14, No. 2 | 2 February 2017
-
Optimal Charging and Discharging Scheduling for Electric Vehicles in a Parking Station with Photovoltaic System and Energy Storage System Energies, Vol. 10, No. 4 | 17 April 2017
-
Quantum speedup of the traveling-salesman problem for bounded-degree graphs Physical Review A, Vol. 95, No. 3 | 22 March 2017
-
On the Effect of Adding Nodes to TSP Instances: An Empirical Analysis Advances in Combining Intelligent Methods | 20 November 2016
-
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks Computer Aided Verification | 13 July 2017
-
Exact Separation of k-Projection Polytope Constraints Modeling and Optimization: Theory and Applications | 1 November 2017
-
The Impact of a Clustering Approach on Solving the Multi-depot IRP Optimization and Decision Science: Methodologies and Applications | 5 November 2017
-
Emergency management using geographic information systems: application to the first Romanian traveling salesman problem instance Knowledge and Information Systems, Vol. 50, No. 1 | 8 April 2016
-
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem Discrete Applied Mathematics, Vol. 217 | 1 Jan 2017
-
Quantum inspired evolutionary algorithm for ordering problems Expert Systems with Applications, Vol. 67 | 1 Jan 2017
-
A stochastic programming approach for the traveling purchaser problem IMA Journal of Management Mathematics, Vol. 28, No. 1 | 4 August 2015
-
Optimal Recharging With Practical Considerations in Wireless Rechargeable Sensor Network IEEE Access, Vol. 5 | 1 Jan 2017
-
A Real-Time Charging Scheme for Demand Response in Electric Vehicle Parking Station IEEE Transactions on Smart Grid, Vol. 8, No. 1 | 1 Jan 2017
-
RETRy Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'17 | 1 Jan 2017
-
Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm Cogent Mathematics, Vol. 3, No. 1 | 31 March 2016
-
Ordered spatial sampling by means of the traveling salesman problem Computational Statistics, Vol. 31, No. 4 | 5 January 2016
-
Recharging versus replacing sensor nodes using mobile robots for network maintenance Telecommunication Systems, Vol. 63, No. 4 | 4 February 2016
-
Customizing the solution process of COIN-OR’s linear solvers with Python Mathematical Programming Computation, Vol. 8, No. 4 | 5 October 2015
-
Synthesis of multi-period heat exchanger networks based on features of sub-period durations Energy, Vol. 116 | 1 Dec 2016
-
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs Information Sciences, Vol. 374 | 1 Dec 2016
-
Revisiting Practical Energy Harvesting Wireless Sensor Network with Optimal Scheduling 2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) | 1 Dec 2016
-
Real-Time Energy Management Optimization for Smart Household 2016 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) | 1 Dec 2016
-
Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms Transport and Telecommunication Journal, Vol. 17, No. 4 | 23 November 2016
-
Sensor Networks with Wireless Energy Harvesting Wireless-Powered Communication Networks | 17 Nov 2016
-
Hospital Readmissions Reduction Program: An Economic and Operational Analysis Management Science, Vol. 62, No. 11 | 1 Nov 2016
-
A pure proactive scheduling algorithm for multiple earth observation satellites under uncertainties of clouds Computers & Operations Research, Vol. 74 | 1 Oct 2016
-
Secure Overlay Routing Using Key Pre-Distribution: A Linear Distance Optimization Approach IEEE Transactions on Mobile Computing, Vol. 15, No. 9 | 1 Sep 2016
-
A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations Journal of Scheduling, Vol. 19, No. 4 | 13 March 2015
-
The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace Transportation Research Part B: Methodological, Vol. 90 | 1 Aug 2016
-
Global optimization with spline constraints: a new branch-and-bound method based on B-splines Journal of Global Optimization, Vol. 65, No. 3 | 3 September 2015
-
Discrete Bat Algorithm for Traveling Salesman Problem 2016 3rd International Conference on Information Science and Control Engineering (ICISCE) | 1 Jul 2016
-
An interacting replica approach applied to the traveling salesman problem 2016 SAI Computing Conference (SAI) | 1 Jul 2016
-
Deriving compact extended formulations via LP-based separation techniques Annals of Operations Research, Vol. 240, No. 1 | 22 September 2015
-
Finding optimal isomorphic goal adjacency 2016 IEEE International Conference on Robotics and Automation (ICRA) | 1 May 2016
-
Multicommodity vs. Single-Commodity Routing Transportation Science, Vol. 50, No. 2 | 1 May 2016
-
Generation of fiducial marker dictionaries using Mixed Integer Linear Programming Pattern Recognition, Vol. 51 | 1 Mar 2016
-
Scalable package queries in relational database systems Proceedings of the VLDB Endowment, Vol. 9, No. 7 | 1 March 2016
-
Using branch-and-bound algorithms to optimize selection of a fixed-size breeding population under a relatedness constraint Tree Genetics & Genomes, Vol. 12, No. 1 | 26 December 2015
-
DASH: Dynamic Approach for Switching Heuristics European Journal of Operational Research, Vol. 248, No. 3 | 1 Feb 2016
-
On social network firewall selection 2016 International Conference on Computing, Networking and Communications (ICNC) | 1 Feb 2016
-
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning Discrete Optimization, Vol. 19 | 1 Feb 2016
-
An efficient approach for solving mixed-integer programming problems under the monotonic condition Journal of Control and Decision, Vol. 3, No. 1 | 28 January 2016
-
Introduction Mixed-Integer Representations in Control Design | 26 November 2015
-
Solving the Routing Problems with Time Windows Self-Organizing Migrating Algorithm | 5 February 2016
-
The Plant Propagation Algorithm for Discrete Optimisation: The Case of the Travelling Salesman Problem Nature-Inspired Computation in Engineering | 20 March 2016
-
Logic-Based Decomposition Methods for the Travelling Purchaser Problem Integration of AI and OR Techniques in Constraint Programming | 12 May 2016
-
Computing Nonsimple Polygons of Minimum Perimeter Experimental Algorithms | 1 June 2016
-
On the Facets of Combinatorial Polytopes Discrete Optimization and Operations Research | 10 September 2016
-
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories Combinatorial Optimization | 10 September 2016
-
The Nurse Routing Problem with Workload Constraints and Incompatible Services IFAC-PapersOnLine, Vol. 49, No. 12 | 1 Jan 2016
-
Wireless Charging Technologies: Fundamentals, Standards, and Network Applications IEEE Communications Surveys & Tutorials, Vol. 18, No. 2 | 1 Jan 2016
-
Development of Decision Support System for the Work Shift Table with Integer Programing according to the Requests and Wages for Part-timers IEEJ Transactions on Electronics, Information and Systems, Vol. 136, No. 11 | 1 Jan 2016
-
A semidefinite optimization approach to the Target Visitation Problem Optimization Letters, Vol. 9, No. 8 | 11 November 2014
-
Visually-driven parallel solving of multi-objective land-use allocation problems: a case study in Chelan, Washington Earth Science Informatics, Vol. 8, No. 4 | 21 February 2015
-
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence Computers & Operations Research, Vol. 64 | 1 Dec 2015
-
A branch-and-cut algorithm for a realistic dial-a-ride problem Transportation Research Part B: Methodological, Vol. 81 | 1 Nov 2015
-
A review of tactical optimization models for integrated production and transport routing planning decisions Computers & Industrial Engineering, Vol. 88 | 1 Oct 2015
-
The precedence constrained knapsack problem: Separating maximally violated inequalities Discrete Applied Mathematics, Vol. 194 | 1 Oct 2015
-
Path optimization with limited sensing ability Journal of Computational Physics, Vol. 299 | 1 Oct 2015
-
Multi-period Vehicle Routing Problem with Due dates Computers & Operations Research, Vol. 61 | 1 Sep 2015
-
Algorithms for finding generalized minimum aberration designs Journal of Complexity, Vol. 31, No. 4 | 1 Aug 2015
-
An optimised target-level inventory replenishment policy for vendor-managed inventory systems International Journal of Production Research, Vol. 53, No. 12 | 8 December 2014
-
TCWTP: Time-Constrained Weighted Targets Patrolling Mechanism in Wireless Mobile Sensor Networks IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 45, No. 6 | 1 Jun 2015
-
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem Computation, Vol. 3, No. 2 | 3 June 2015
-
Local search inequalities Discrete Optimization, Vol. 16 | 1 May 2015
-
Classification, models and exact algorithms for multi-compartment delivery problems European Journal of Operational Research, Vol. 242, No. 3 | 1 May 2015
-
A restricted neighbourhood Tabu Search for Storage Location Assignment Problem 2015 IEEE Congress on Evolutionary Computation (CEC) | 1 May 2015
-
A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia Omega, Vol. 51 | 1 Mar 2015
-
Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances Networks, Vol. 65, No. 2 | 2 February 2015
-
A Shuffled Complex Evolution Algorithm For the Multidimensional Knapsack Problem Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 25 October 2015
-
Optimal consumed electric energy while sequencing vehicle trips in a personal rapid transit transportation system Computers & Industrial Engineering, Vol. 79 | 1 Jan 2015
-
The dynamic routing algorithm for renewable wireless sensor networks with wireless power transfer Computer Networks, Vol. 74 | 1 Dec 2014
-
The Rural Postman Problem with time windows Networks, Vol. 64, No. 3 | 7 October 2014
-
The Clustered Orienteering Problem European Journal of Operational Research, Vol. 238, No. 2 | 1 Oct 2014
-
Branch and Bound Wiley StatsRef: Statistics Reference Online | 29 September 2014
-
Deriving compact extended formulations via LP-based separation techniques 4OR, Vol. 12, No. 3 | 24 June 2014
-
Improved solutions for inventory-routing problems through valid inequalities and input ordering International Journal of Production Economics, Vol. 155 | 1 Sep 2014
-
Cellular Competitive Decision Algorithm for Traveling Salesman Problem 2014 Enterprise Systems Conference | 1 Aug 2014
-
A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times Transportation Science, Vol. 48, No. 3 | 1 Aug 2014
-
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem INFORMS Journal on Computing, Vol. 26, No. 3 | 1 Aug 2014
-
Polyhedral Approaches Concepts of Combinatorial Optimization | 8 August 2014
-
General Bibliography Concepts of Combinatorial Optimization | 8 August 2014
-
General Bibliography Paradigms of Combinatorial Optimization | 8 August 2014
-
The Maximum Cut Problem Paradigms of Combinatorial Optimization | 8 August 2014
-
Optimal joint replenishment, delivery and inventory management policies for perishable products Computers & Operations Research, Vol. 47 | 1 Jul 2014
-
Model and Algorithm for Wagons' Placing-In and Taking-Out Problem in Railway Station CICTP 2014 | 2 July 2014
-
Using UML and OCL for representing multiobjective combinatorial optimization problems Journal of Intelligent Manufacturing, Vol. 25, No. 3 | 3 November 2012
-
Combinatorial Optimization Computing Handbook, Third Edition | 8 May 2014
-
Formulations for an inventory routing problem International Transactions in Operational Research, Vol. 21, No. 3 | 5 February 2014
-
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics Discrete Applied Mathematics, Vol. 166 | 1 Mar 2014
-
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm Discrete Applied Mathematics, Vol. 164 | 1 Feb 2014
-
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
-
A Purely Proactive Scheduling Procedure for the Resource-Constrained Project Scheduling Problem with Stochastic Activity Durations SSRN Electronic Journal, Vol. 67 | 1 Jan 2014
-
A Pure Proactive Scheduling Algorithm for Multiple Earth Observation Satellites Under Uncertainties of Clouds SSRN Electronic Journal | 1 Jan 2014
-
Linear Inequalities and Polyhedra Integer Programming | 26 September 2014
-
Semidefinite Bounds Integer Programming | 26 September 2014
-
Getting Started Integer Programming | 26 September 2014
-
Model Reformulations and Tightening Solving Non-standard Packing Problems by Global Optimization and Heuristics | 27 March 2014
-
Enumeration Integer Programming | 26 September 2014
-
Reformulations and Relaxations Integer Programming | 26 September 2014
-
Valid Inequalities for Structured Integer Programs Integer Programming | 26 September 2014
-
A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem International Journal of Production Research, Vol. 51, No. 23-24 | 14 February 2013
-
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem Annals of Mathematics and Artificial Intelligence, Vol. 69, No. 2 | 28 March 2013
-
A Market-based Solution to the Multiple Traveling Salesmen Problem Journal of Intelligent & Robotic Systems, Vol. 72, No. 1 | 30 January 2013
-
Compact formulations of the Steiner Traveling Salesman Problem and related problems European Journal of Operational Research, Vol. 228, No. 1 | 1 Jul 2013
-
The travelling salesman problem with neighbourhoods: MINLP solution Optimization Methods and Software, Vol. 28, No. 2 | 1 Apr 2013
-
Polyhedral Approaches Concepts of Combinatorial Optimization | 21 January 2013
-
The Maximum Cut Problem Paradigms of Combinatorial Optimization | 13 February 2013
-
The exact solution of several classes of inventory-routing problems Computers & Operations Research, Vol. 40, No. 2 | 1 Feb 2013
-
A stochastic inventory routing problem with stock-out Transportation Research Part C: Emerging Technologies, Vol. 27 | 1 Feb 2013
-
Traveling Salesman Problem Encyclopedia of Operations Research and Management Science | 23 January 2016
-
Integer and Combinatorial Optimization Encyclopedia of Operations Research and Management Science | 23 January 2016
-
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem Swarm, Evolutionary, and Memetic Computing | 1 Jan 2013
-
Progress in Academic Computational Integer Programming Facets of Combinatorial Optimization | 1 Jan 2013
-
A Hard Problem: The TSP Graphs, Networks and Algorithms | 1 Jan 2013
-
Mixed Integer Programming: Analyzing 12 Years of Progress Facets of Combinatorial Optimization | 1 Jan 2013
-
Reformulation–Linearization Techniques for Discrete Optimization Problems Handbook of Combinatorial Optimization | 26 July 2013
-
Making Sensor Networks Immortal: An Energy-Renewal Approach With Wireless Power Transfer IEEE/ACM Transactions on Networking, Vol. 20, No. 6 | 1 Dec 2012
-
Branch‐and‐Bound Algorithm Encyclopedia of Environmetrics | 15 September 2006
-
Could we use a million cores to solve an integer program? Mathematical Methods of Operations Research, Vol. 76, No. 1 | 9 May 2012
-
Robust Inventory Routing Under Demand Uncertainty Transportation Science, Vol. 46, No. 3 | 1 Aug 2012
-
A new heuristic algorithm for laser antimissile strategy optimization Journal of Industrial and Management Optimization, Vol. 8, No. 2 | 1 Apr 2012
-
Solving survivable two-layer network design problems by metric inequalities Computational Optimization and Applications, Vol. 51, No. 2 | 23 October 2010
-
Global optimality conditions and optimization methods for quadratic assignment problems Applied Mathematics and Computation, Vol. 218, No. 11 | 1 Feb 2012
-
Uma nova abordagem branch and cut aplicada ao problema de planejamento da expansão de redes de transmissão de grande porte Sba: Controle & Automação Sociedade Brasileira de Automatica, Vol. 23, No. 1 | 1 Feb 2012
-
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design SIAM Journal on Optimization, Vol. 22, No. 4 | 15 November 2012
-
Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives Modeling and Optimization in Space Engineering | 27 August 2012
-
A Genetic Algorithm for Planning Travel Route with Mimimum Transportation Carbon Footprint Information and Business Intelligence | 1 Jan 2012
-
Generating High Quality Candidate Sets by Tour Merging for the Traveling Salesman Problem Information and Software Technologies | 1 Jan 2012
-
Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness Learning and Intelligent Optimization | 1 Jan 2012
-
Rutas de recogida de muestras y error en el proceso analítico Revista del Laboratorio Clínico, Vol. 5, No. 1 | 1 Jan 2012
-
Analysis of the maximum level policy in a production-distribution system Computers & Operations Research, Vol. 38, No. 12 | 1 Dec 2011
-
Seeking global edges for traveling salesman problem in multi-start search Journal of Global Optimization, Vol. 51, No. 3 | 6 January 2011
-
Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem Computers & Mathematics with Applications, Vol. 62, No. 7 | 1 Oct 2011
-
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks Computer Networks, Vol. 55, No. 13 | 1 Sep 2011
-
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem Transportation Science, Vol. 45, No. 3 | 1 Aug 2011
-
Heuristic and exact algorithms for a min–max selective vehicle routing problem Computers & Operations Research, Vol. 38, No. 7 | 1 Jul 2011
-
Routing problems: a historical perspective BSHM Bulletin: Journal of the British Society for the History of Mathematics, Vol. 26, No. 2 | 1 Jul 2011
-
Elastic net with stochastic noise strategy and time-dependent parameters for TSP 2011 Seventh International Conference on Natural Computation | 1 Jul 2011
-
Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem 2011 Seventh International Conference on Natural Computation | 1 Jul 2011
-
A Branch-and-Cut method for the Capacitated Location-Routing Problem Computers & Operations Research, Vol. 38, No. 6 | 1 Jun 2011
-
A mathematical optimization technique for managing selective catalytic reduction for coal-fired power plants Energy Systems, Vol. 2, No. 2 | 26 March 2011
-
Information-theoretic approaches to branching in search Discrete Optimization, Vol. 8, No. 2 | 1 May 2011
-
A new method for laser antimissile strategy optimization 2011 Chinese Control and Decision Conference (CCDC) | 1 May 2011
-
Survivable network design with demand uncertainty European Journal of Operational Research, Vol. 210, No. 1 | 1 Apr 2011
-
On renewable sensor networks with wireless energy transfer 2011 Proceedings IEEE INFOCOM | 1 Apr 2011
-
Computing compatible tours for the symmetric traveling salesman problem Mathematical Programming Computation, Vol. 3, No. 1 | 29 December 2010
-
Decomposition Methods for Integer Programming Wiley Encyclopedia of Operations Research and Management Science | 15 February 2011
-
MILP Software Wiley Encyclopedia of Operations Research and Management Science | 14 January 2011
-
Learning in Search Hybrid Optimization | 23 October 2010
-
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm Network Optimization | 1 Jan 2011
-
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem Network Optimization | 1 Jan 2011
-
ParaSCIP: A Parallel Extension of SCIP Competence in High Performance Computing 2010 | 8 November 2011
-
Combinatorial Traveling Salesman Problem Algorithms Wiley Encyclopedia of Operations Research and Management Science | 15 February 2011
-
Branch and Cut Wiley Encyclopedia of Operations Research and Management Science | 14 January 2011
-
Mathematical Programming Approaches to the Traveling Salesman Problem Wiley Encyclopedia of Operations Research and Management Science | 14 January 2011
-
Technical and industrial issues of Advanced Planning and Scheduling (APS) systems Computers in Industry, Vol. 61, No. 9 | 1 Dec 2010
-
Applying simulated annealing for designing cellular manufacturing systems using MDmTSP Computers & Industrial Engineering, Vol. 59, No. 4 | 1 Nov 2010
-
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation Networks, Vol. 56, No. 3 | 18 December 2009
-
A note on branch-and-cut-and-price Operations Research Letters, Vol. 38, No. 5 | 1 Sep 2010
-
A Modified Gene Optimization for TSP Applied Mechanics and Materials, Vol. 29-32 | 1 August 2010
-
Multi-step methods for choosing the best set of variables in regression analysis Computational Optimization and Applications, Vol. 46, No. 3 | 23 August 2008
-
Fifty Years of Integer Programming: A Review of the Solution Approaches Asia Pacific Business Review, Vol. 6, No. 3 | 1 July 2010
-
A hybrid swarm intelligence algorithm for the travelling salesman problem Expert Systems, Vol. 27, No. 3 | 6 July 2010
-
Improved WLP and GWP lower bounds based on exact integer programming Journal of Statistical Planning and Inference, Vol. 140, No. 5 | 1 May 2010
-
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization International Journal of Strategic Decision Sciences, Vol. 1, No. 2 | 1 Apr 2010
-
Fifty-Plus Years of Combinatorial Integer Programming 50 Years of Integer Programming 1958-2008 | 6 November 2009
-
Mixed Integer Programming Computation 50 Years of Integer Programming 1958-2008 | 6 November 2009
-
Symmetry in Integer Linear Programming 50 Years of Integer Programming 1958-2008 | 6 November 2009
-
Optimization Problems with Cardinality Constraints Computational Intelligence in Optimization | 1 Jan 2010
-
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation Experimental Algorithms | 1 Jan 2010
-
Evaluating the impact of AND/OR search on 0-1 integer linear programming Constraints, Vol. 15, No. 1 | 18 March 2009
-
A concise guide to the Traveling Salesman Problem Journal of the Operational Research Society, Vol. 61, No. 1 | 21 December 2017
-
References Applied Integer Programming | 13 September 2011
-
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized Electronic Notes in Discrete Mathematics, Vol. 35 | 1 Dec 2009
-
Total Cost Minimization of a High-Pressure Natural Gas Network Journal of Energy Resources Technology, Vol. 131, No. 4 | 12 November 2009
-
Branch-and-Cut Algorithmic Framework for 0−1 Mixed-Integer Convex Nonlinear Programs Industrial & Engineering Chemistry Research, Vol. 48, No. 20 | 18 September 2009
-
A 0–1 LP Model for the Integration and Consolidation of Air Cargo Shipments Operations Research, Vol. 57, No. 2 | 1 Apr 2009
-
0–1 reformulations of the multicommodity capacitated network design problem Discrete Applied Mathematics, Vol. 157, No. 6 | 1 Mar 2009
-
Quadratic Assignment Problem Facility Location | 27 April 2009
-
Certification of an optimal TSP tour through 85,900 cities Operations Research Letters, Vol. 37, No. 1 | 1 Jan 2009
-
Undirected postman problems with zigzagging option: A cutting-plane approach Computers & Operations Research, Vol. 35, No. 12 | 1 Dec 2008
-
Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal Pesquisa Operacional, Vol. 28, No. 3 | 1 Dec 2008
-
An improved branch‐and‐cut algorithm for mixed‐integer nonlinear systems optimization problem AIChE Journal, Vol. 54, No. 12 | 3 November 2008
-
Preprocessing composite cutting procedure: an approach to the integer model Journal of Interdisciplinary Mathematics, Vol. 11, No. 5 | 1 Oct 2008
-
The optimization of printed circuit board manufacturing by improving the drilling process productivity Computers & Industrial Engineering, Vol. 55, No. 2 | 1 Sep 2008
-
Formulations and exact algorithms for the vehicle routing problem with time windows Computers & Operations Research, Vol. 35, No. 7 | 1 Jul 2008
-
An algorithmic framework for convex mixed integer nonlinear programs Discrete Optimization, Vol. 5, No. 2 | 1 May 2008
-
Exploiting planarity in separation routines for the symmetric traveling salesman problem Discrete Optimization, Vol. 5, No. 2 | 1 May 2008
-
A survey on pickup and delivery problems Journal für Betriebswirtschaft, Vol. 58, No. 1 | 13 March 2008
-
Classification of orthogonal arrays by integer programming Journal of Statistical Planning and Inference, Vol. 138, No. 3 | 1 Mar 2008
-
Branch-and-Cut for the Maximum Feasible Subsystem Problem SIAM Journal on Optimization, Vol. 19, No. 1 | 6 February 2008
-
Integer Programming: Branch and Bound Methods Encyclopedia of Optimization | 1 Jan 2008
-
Integer Programming: Branch and Cut Algorithms Encyclopedia of Optimization | 1 Jan 2008
-
Integer Programming: Cutting Plane Algorithms Encyclopedia of Optimization | 1 Jan 2008
-
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) INFORMS Journal on Computing, Vol. 19, No. 3 | 1 Aug 2007
-
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem Transportation Science, Vol. 41, No. 3 | 1 Aug 2007
-
Static pickup and delivery problems: a classification scheme and survey TOP, Vol. 15, No. 1 | 18 April 2007
-
Vašek Chvátal: A Very Short Introduction Graphs and Combinatorics, Vol. 23, No. S1 | 1 Jun 2007
-
Active-constraint variable ordering for faster feasibility of mixed integer linear programs Mathematical Programming, Vol. 110, No. 3 | 11 July 2006
-
On the domino-parity inequalities for the STSP Mathematical Programming, Vol. 110, No. 3 | 29 July 2006
-
Symmetric ILP: Coloring and small integers Discrete Optimization, Vol. 4, No. 1 | 1 Mar 2007
-
Revival of the Gomory cuts in the 1990’s Annals of Operations Research, Vol. 149, No. 1 | 2 December 2006
-
A survey for the quadratic assignment problem European Journal of Operational Research, Vol. 176, No. 2 | 1 Jan 2007
-
Mixed-Integer Nonlinear Programming Optimization Strategies for Batch Plant Design Problems Industrial & Engineering Chemistry Research, Vol. 46, No. 3 | 23 December 2006
-
Using Classifiers to Solve Warehouse Location Problems 2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07) | 1 Jan 2007
-
A Hybrid Method for Solving Traveling Salesman Problem 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007) | 1 Jan 2007
-
Acceleration of cutting‐plane and column generation algorithms: Applications to network design Networks, Vol. 49, No. 1 | 2 October 2006
-
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities Mathematics of Operations Research, Vol. 31, No. 4 | 1 Nov 2006
-
A stabilized column generation scheme for the traveling salesman subtour problem Discrete Applied Mathematics, Vol. 154, No. 15 | 1 Oct 2006
-
The capacitated vehicle routing problem with reloads 2006 International Conference on Service Systems and Service Management | 1 Oct 2006
-
A constraint generation algorithm for large scale linear programs using multiple-points separation Mathematical Programming, Vol. 107, No. 3 | 30 December 2005
-
Problems of discrete optimization: Challenges and main approaches to solve them Cybernetics and Systems Analysis, Vol. 42, No. 4 | 1 Jul 2006
-
Gomory's method based on the objective equivalent face technique Wuhan University Journal of Natural Sciences, Vol. 11, No. 3 | 1 May 2006
-
Perspective cuts for a class of convex 0–1 mixed integer programs Mathematical Programming, Vol. 106, No. 2 | 14 July 2005
-
Using Lagrangian dual information to generate degree constrained spanning trees Discrete Applied Mathematics, Vol. 154, No. 5 | 1 Apr 2006
-
Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds European Journal of Operational Research, Vol. 168, No. 3 | 1 Feb 2006
-
Vehicle Routing Handbook of Constraint Programming | 1 Jan 2006
-
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut RAIRO - Operations Research, Vol. 40, No. 1 | 1 July 2006
-
Integer Programming for Telecommunications Handbook of Optimization in Telecommunications | 1 Jan 2006
-
Exact methods based on node‐routing formulations for undirected arc‐routing problems Networks, Vol. 47, No. 1 | 7 December 2005
-
Airline Crew Scheduling: State-of-the-Art Annals of Operations Research, Vol. 140, No. 1 | 1 Nov 2005
-
Non Delayed Relax-and-Cut Algorithms Annals of Operations Research, Vol. 140, No. 1 | 1 Nov 2005
-
About Lagrangian Methods in Integer Optimization Annals of Operations Research, Vol. 139, No. 1 | 1 Oct 2005
-
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut Annals of Operations Research, Vol. 139, No. 1 | 1 Oct 2005
-
Design of planar articulated mechanisms using branch and bound Mathematical Programming, Vol. 103, No. 2 | 28 April 2005
-
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem European Journal of Operational Research, Vol. 162, No. 3 | 1 May 2005
-
Integer programming approach to the printed circuit board grouping problem International Journal of Production Research, Vol. 43, No. 8 | 15 Apr 2005
-
Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions Journal of Network and Systems Management, Vol. 13, No. 1 | 1 Mar 2005
-
Meta-RaPS: a simple and effective approach for solving the traveling salesman problem Transportation Research Part E: Logistics and Transportation Review, Vol. 41, No. 2 | 1 Mar 2005
-
The biobjective travelling purchaser problem European Journal of Operational Research, Vol. 160, No. 3 | 1 Feb 2005
-
A Study of Domino-Parity and k-Parity Constraints for the TSP Integer Programming and Combinatorial Optimization | 1 Jan 2005
-
BIBLIOGRAPHY Stochastic Local Search | 1 Jan 2005
-
An asexual genetic algorithm for the general single vehicle routing problem Engineering Optimization, Vol. 37, No. 1 | 1 Jan 2005
-
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Discrete Applied Mathematics, Vol. 145, No. 1 | 1 Dec 2004
-
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem Transportation Science, Vol. 38, No. 4 | 1 Nov 2004
-
A branch-and-cut algorithm for the plant-cycle location problem Journal of the Operational Research Society, Vol. 55, No. 5 | 21 December 2017
-
Uma revisão comentada das abordagens do problema quadrático de alocação Pesquisa Operacional, Vol. 24, No. 1 | 1 Apr 2004
-
Exploiting Relaxations in CP Constraint and Integer Programming | 1 Jan 2004
-
Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 1 Jan 2004
-
Design the Hardware of Genetic Algorithm for TSP and MSA Knowledge-Based Intelligent Information and Engineering Systems | 1 Jan 2004
-
Abilio Lucena Top, Vol. 11, No. 2 | 1 Dec 2003
-
Parallel branch and cut for capacitated vehicle routing Parallel Computing, Vol. 29, No. 5 | 1 May 2003
-
Discrete tomography and joint inversion for loosely connected or unconnected physical properties: application to crosshole seismic and georadar data sets Geophysical Journal International, Vol. 153, No. 2 | 1 May 2003
-
An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem Transportation Science, Vol. 37, No. 2 | 1 May 2003
-
Stochastic Vehicle Routing with Random Travel Times Transportation Science, Vol. 37, No. 1 | 1 Feb 2003
-
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem Combinatorial Optimization — Eureka, You Shrink! | 30 January 2003
-
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming Combinatorial Optimization — Eureka, You Shrink! | 30 January 2003
-
Optimisation of the interconnecting network of a UMTS radio mobile telephone system European Journal of Operational Research, Vol. 144, No. 1 | 1 Jan 2003
-
A cutting plane algorithm for the unrelated parallel machine scheduling problem European Journal of Operational Research, Vol. 141, No. 3 | 1 Sep 2002
-
Perturbation heuristics for the pickup and delivery traveling salesman problem Computers & Operations Research, Vol. 29, No. 9 | 1 Aug 2002
-
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows Transportation Science, Vol. 36, No. 2 | 1 May 2002
-
Free‐listed items are effective cues for eliciting additional items in semantic domains Applied Cognitive Psychology, Vol. 16, No. 3 | 8 March 2002
-
Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs Parallel Problem Solving from Nature — PPSN VII | 4 October 2002
-
SCIL — Symbolic Constraints in Integer Linear Programming Algorithms — ESA 2002 | 29 August 2002
-
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications Computational Science — ICCS 2002 | 10 April 2002
-
Polynomial-Time Separation of Simple Comb Inequalities Integer Programming and Combinatorial Optimization | 21 May 2002
-
Recent Algorithmic Advances for Arc Routing Problems Operations Research/Management Science at Work | 1 Jan 2002
-
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems INFORMS Journal on Computing, Vol. 13, No. 4 | 1 Nov 2001
-
Statistical mechanics methods and phase transitions in optimization problems Theoretical Computer Science, Vol. 265, No. 1-2 | 1 Aug 2001
-
Sorting Permutations by Reversals Through Branch-and-Price INFORMS Journal on Computing, Vol. 13, No. 3 | 1 Aug 2001
-
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints Management Science, Vol. 47, No. 7 | 1 Jul 2001
-
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems Management Science, Vol. 47, No. 6 | 1 Jun 2001
-
Octane: A New Heuristic for Pure 0–1 Programs Operations Research, Vol. 49, No. 2 | 1 Apr 2001
-
A branch and cut method for the degree-constrained minimum spanning tree problem Networks, Vol. 37, No. 2 | 1 January 2001
-
A solving method for singly routing traffic demand in telecommunication networks Annales Des Télécommunications, Vol. 56, No. 3-4 | 1 Mar 2001
-
Branch and cut methods for network optimization Mathematical and Computer Modelling, Vol. 33, No. 4-5 | 1 Feb 2001
-
Traveling salesman problem Encyclopedia of Operations Research and Management Science | 25 October 2005
-
Combinatorial and integer optimization Encyclopedia of Operations Research and Management Science | 25 October 2005
-
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS Computational Combinatorial Optimization | 19 November 2001
-
Branch, Cut, and Price: Sequential and Parallel Computational Combinatorial Optimization | 19 November 2001
-
TSP Cuts Which Do Not Conform to the Template Paradigm Computational Combinatorial Optimization | 19 November 2001
-
From Ground Holding to Free Flight: An Exact Approach Transportation Science, Vol. 34, No. 4 | 1 Nov 2000
-
An effective implementation of the Lin–Kernighan traveling salesman heuristic European Journal of Operational Research, Vol. 126, No. 1 | 1 Oct 2000
-
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization Software: Practice and Experience, Vol. 30, No. 11 | 1 January 2000
-
A linearization method for mixed 0–1 polynomial programs Computers & Operations Research, Vol. 27, No. 10 | 1 Sep 2000
-
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems European Journal of Operational Research, Vol. 125, No. 2 | 1 Sep 2000
-
Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints Journal of the American Statistical Association, Vol. 95, No. 451 | 1 Sep 2000
-
A heuristic for the pickup and delivery traveling salesman problem Computers & Operations Research, Vol. 27, No. 9 | 1 Aug 2000
-
Separating a Superclass of Comb Inequalities in Planar Graphs Mathematics of Operations Research, Vol. 25, No. 3 | 1 Aug 2000
-
Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems Computers & Chemical Engineering, Vol. 24, No. 2-7 | 1 Jul 2000
-
Frequency assignment in mobile radio systems using branch-and-cut techniques European Journal of Operational Research, Vol. 123, No. 2 | 1 Jun 2000
-
The multicast packing problem IEEE/ACM Transactions on Networking, Vol. 8, No. 3 | 1 Jun 2000
-
Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements Management Science, Vol. 46, No. 3 | 1 Mar 2000
-
Evaluation Measures of Multiple Sequence Alignments Journal of Computational Biology, Vol. 7, No. 1-2 | 1 Feb 2000
-
Computational Experience with an Interior Point Cutting Plane Algorithm SIAM Journal on Optimization, Vol. 10, No. 4 | 31 July 2006
-
Simulated Annealing With An Optimal Fixed Temperature SIAM Journal on Optimization, Vol. 11, No. 2 | 31 July 2006
-
Polyhedral Theory for Arc Routing Problems Arc Routing | 1 Jan 2000
-
Linear Programming Based Methods for Solving Arc Routing Problems Arc Routing | 1 Jan 2000
-
Branch and Cut Methods for Mixed Integer Linear Programming Problems Progress in Optimization | 1 Jan 2000
-
Routing Through Virtual Paths in Layered Telecommunication Networks Operations Research, Vol. 47, No. 5 | 1 Oct 1999
-
A Computational Study of Search Strategies for Mixed Integer Programming INFORMS Journal on Computing, Vol. 11, No. 2 | 1 May 1999
-
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem Integer Programming and Combinatorial Optimization | 30 April 1999
-
The m-Cost ATSP Integer Programming and Combinatorial Optimization | 30 April 1999
-
On the Separation of Maximally Violated mod-k Cuts Integer Programming and Combinatorial Optimization | 30 April 1999
-
Introduction Linear Optimization and Extensions | 1 Jan 1999
-
Combinatorial Optimization: An Introduction Linear Optimization and Extensions | 1 Jan 1999
-
Primal-Dual Pairs Linear Optimization and Extensions | 1 Jan 1999
-
Ellipsoid Algorithms Linear Optimization and Extensions | 1 Jan 1999
-
A note on formulations for the A-partition problem on hypergraphs Discrete Applied Mathematics, Vol. 90, No. 1-3 | 1 Jan 1999
-
State of the art in parallel search techniques for discrete optimization problems IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No. 1 | 1 Jan 1999
-
Economic spare capacity planning for DCS mesh-restorable networks European Journal of Operational Research, Vol. 110, No. 1 | 1 Oct 1998
-
A branch and cut algorithm for the VRP with satellite facilities IIE Transactions, Vol. 30, No. 9 | 1 Sep 1998
-
The complexity of cover inequality separation Operations Research Letters, Vol. 23, No. 1-2 | 1 Aug 1998
-
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut Operations Research, Vol. 46, No. 3 | 1 Jun 1998
-
Numerical Experience with Lower Bounds for MIQP Branch-And-Bound SIAM Journal on Optimization, Vol. 8, No. 2 | 31 July 2006
-
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Computers & Operations Research, Vol. 25, No. 5 | 1 May 1998
-
Solving the Orienteering Problem through Branch-and-Cut INFORMS Journal on Computing, Vol. 10, No. 2 | 1 May 1998
-
Minimum cost capacity installation for multicommodity network flows Mathematical Programming, Vol. 81, No. 2 | 1 Apr 1998
-
The node capacitated graph partitioning problem: A computational study Mathematical Programming, Vol. 81, No. 2 | 1 Apr 1998
-
Relaxed tours and path ejections for the traveling salesman problem European Journal of Operational Research, Vol. 106, No. 2-3 | 1 Apr 1998
-
Separating capacity constraints in the CVRP using tabu search European Journal of Operational Research, Vol. 106, No. 2-3 | 1 Apr 1998
-
Survey of facial results for the traveling salesman polytope Mathematical and Computer Modelling, Vol. 27, No. 8 | 1 Apr 1998
-
Optimization Applications in the Airline Industry Handbook of Combinatorial Optimization | 1 Jan 1998
-
Interior Point Methods for Combinatorial Optimization Handbook of Combinatorial Optimization | 1 Jan 1998
-
Reformulation-Linearization Techniques for Discrete Optimization Problems Handbook of Combinatorial Optimization | 1 Jan 1998
-
Integer Programming SSRN Electronic Journal, Vol. 44 | 1 Jan 1998
-
Recent Advances in Routing Algorithms Operations Research and Decision Aid Methodologies in Traffic and Transportation Management | 1 Jan 1998
-
On the vehicle routing problem Nonlinear Analysis: Theory, Methods & Applications, Vol. 30, No. 7 | 1 Dec 1997
-
Bibliography Combinatorial Optimization | 30 September 2011
-
A branch-and-cut algorithm for the equicut problem Mathematical Programming, Vol. 78, No. 2 | 1 Aug 1997
-
A branch-and-bound algorithm for the mini-max spanning forest problem European Journal of Operational Research, Vol. 101, No. 1 | 1 Aug 1997
-
The pickup and delivery problem: Faces and branch-and-cut algorithm Computers & Mathematics with Applications, Vol. 33, No. 12 | 1 Jun 1997
-
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems European Journal of Operational Research, Vol. 97, No. 1 | 1 Feb 1997
-
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem European Journal of Operational Research, Vol. 96, No. 3 | 1 Feb 1997
-
Design of capacitated networks with tree configurations Telecommunication Systems, Vol. 6, No. 1 | 1 Dec 1996
-
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method Annals of Operations Research, Vol. 62, No. 1 | 1 Dec 1996
-
Some properties of cliques in 0–1 mixed integer programs Top, Vol. 4, No. 2 | 1 Dec 1996
-
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs SIAM Journal on Discrete Mathematics, Vol. 9, No. 3 | 12 July 2006
-
Maximum planar subgraphs and nice embeddings: Practical layout tools Algorithmica, Vol. 16, No. 1 | 1 Jul 1996
-
Gomory cuts revisited Operations Research Letters, Vol. 19, No. 1 | 1 Jul 1996
-
The use of dynamic programming in genetic algorithms for permutation problems European Journal of Operational Research, Vol. 92, No. 2 | 1 Jul 1996
-
Combinatorial optimization and small polytopes Top, Vol. 4, No. 1 | 1 Jun 1996
-
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0–1 mixed integer programs Top, Vol. 4, No. 1 | 1 Jun 1996
-
A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location Problem Top, Vol. 4, No. 1 | 1 Jun 1996
-
Packing Steiner trees: a cutting plane algorithm and computational results Mathematical Programming, Vol. 72, No. 2 | 1 Feb 1996
-
Combining simulated annealing with local search heuristics Annals of Operations Research, Vol. 63, No. 1 | 1 Feb 1996
-
T Encyclopedia of Operations Research and Management Science | 1 Jan 1996
-
C Encyclopedia of Operations Research and Management Science | 1 Jan 1996
-
Polyhedral Methods in Design Theory Computational and Constructive Design Theory | 1 Jan 1996
-
Routing problems: A bibliography Annals of Operations Research, Vol. 61, No. 1 | 1 Dec 1995
-
Exact solution of large-scale, asymmetric traveling salesman problems ACM Transactions on Mathematical Software, Vol. 21, No. 4 | 1 December 1995
-
Ideal polytopes and face structures of some combinatorial optimization problems Mathematical Programming, Vol. 71, No. 1 | 1 Nov 1995
-
A strong cutting plane algorithm for the robotic assembly line balancing problem International Journal of Production Research, Vol. 33, No. 8 | 3 April 2007
-
Worst-case comparison of valid inequalities for the TSP Mathematical Programming, Vol. 69, No. 1-3 | 1 Jul 1995
-
DCABB: A distributed control architecture for branch and bound calculations Computers & Chemical Engineering, Vol. 19, No. 6-7 | 1 Jun 1995
-
Some thoughts on combinatorial optimisation European Journal of Operational Research, Vol. 83, No. 2 | 1 Jun 1995
-
Ladders for Travelling Salesmen SIAM Journal on Optimization, Vol. 5, No. 2 | 13 July 2006
-
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming SIAM Journal on Optimization, Vol. 5, No. 2 | 13 July 2006
-
Distances between traveling salesman tours Discrete Applied Mathematics, Vol. 58, No. 3 | 1 Apr 1995
-
Solving pseudo-Boolean constraints Constraint Programming: Basics and Trends | 7 June 2005
-
A parallel formulation for general branch-and-bound algorithms Parallel Algorithms for Irregularly Structured Problems | 4 June 2005
-
How to exploit the intractability of exact TSP for cryptography Fast Software Encryption | 2 June 2005
-
How traveling salespersons prove their identity Cryptography and Coding | 7 June 2005
-
An Overview of Tabu Search Approaches to Production Scheduling Problems Intelligent Scheduling Systems | 1 Jan 1995
-
Bestimmung optimaler Einsatzpläne für Flugpersonal Mathematik in der Praxis | 1 Jan 1995
-
Chaotic simulated annealing by a neural network model with transient chaos Neural Networks, Vol. 8, No. 6 | 1 Jan 1995
-
Chapter 4 The traveling salesman problem Network Models | 1 Jan 1995
-
A branch-and-cut algorithm for vehicle routing problems Annals of Operations Research, Vol. 50, No. 1 | 1 Dec 1994
-
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem Annals of Operations Research, Vol. 50, No. 1 | 1 Dec 1994
-
On the complexity of some basic problems in computational convexity: I. Containment problems Discrete Mathematics, Vol. 136, No. 1-3 | 1 Dec 1994
-
A generalized exchange heuristic for the capacitated vehicle routing problem International Journal of Systems Science, Vol. 25, No. 11 | 1 Nov 1994
-
Outer-Facial Graphs and the Traveling Salesman Problem SIAM Journal on Optimization, Vol. 4, No. 3 | 13 July 2006
-
Provably good solutions for the traveling salesman problem ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, Vol. 40, No. 2 | 1 Jun 1994
-
An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers SIAM Journal on Optimization, Vol. 4, No. 2 | 13 July 2006
-
A modified edge recombination operator for the Travelling Salesman Problem Parallel Problem Solving from Nature — PPSN III | 8 June 2005
-
Optimization by Multicanonical Annealing and the Traveling-Salesman Problem Computer Simulation Studies in Condensed-Matter Physics VII | 1 Jan 1994
-
A cutting plane algorithm for the max-cut problem Optimization Methods and Software, Vol. 3, No. 1-3 | 1 Jan 1994
-
A column generation algorithm for bandwidth packing Telecommunication Systems, Vol. 2, No. 1 | 1 Dec 1993
-
Strong formulations and cutting planes for designing digital data service networks Telecommunication Systems, Vol. 2, No. 1 | 1 Dec 1993
-
O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates Top, Vol. 1, No. 1 | 1 Dec 1993
-
Precedence constrained TSP applied to circuit board assembly and no wait flowshop International Journal of Production Research, Vol. 31, No. 9 | 1 Sep 1993
-
A modified Lin-Kernighan traveling-salesman heuristic Operations Research Letters, Vol. 13, No. 3 | 1 Apr 1993
-
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) SIAM Journal on Optimization, Vol. 3, No. 1 | 13 July 2006
-
The graphical relaxation: A new framework for the symmetric traveling salesman polytope Mathematical Programming, Vol. 58, No. 1-3 | 1 Jan 1993
-
Hamiltonian path and symmetric travelling salesman polytopes Mathematical Programming, Vol. 58, No. 1-3 | 1 Jan 1993
-
On symmetric subtour problems Japan Journal of Industrial and Applied Mathematics, Vol. 9, No. 3 | 1 Oct 1992
-
A cutting plane algorithm for the windy postman problem Mathematical Programming, Vol. 55, No. 1-3 | 1 Apr 1992
-
Formulations for the Multi-Item Lot Sizing Problem with Joint Replenishments - Some Extensions SSRN Electronic Journal | 1 Jan 1992
-
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities Mathematical Programming, Vol. 51, No. 1-3 | 1 Jul 1991
-
Solving Hard Mixed-Integer Programs for Electricity Generation The Next Generation of Electric Power Unit Commitment Models
-
Integer Programming: Branch and Bound Methods Encyclopedia of Optimization
-
Integer Programming: Branch and Cut Algorithms Encyclopedia of Optimization
-
Integer Programming: Cutting Plane Algorithms Encyclopedia of Optimization
-
A Branch-and-Cut to the Point-to-Point Connection Problem on Multicast Networks Variational Analysis and Applications
-
Recent Trends in Arc Routing Graph Theory, Combinatorics and Algorithms
-
Measuring Spatial Separation: Distance, Time, Routing, and Accessibility Location, Transport and Land-Use
-
Lagrangian Relax-and-Cut Algorithms Handbook of Optimization in Telecommunications
-
Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings.
-
A computational study for demand-wise shared protection DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.
-
Dynamical random neural network approach to the traveling salesman problem Proceedings of IEEE Systems Man and Cybernetics Conference - SMC
-
Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network Proceedings of 9th International Parallel Processing Symposium
-
Simple approach to TSP by permutation of six cities and deletion of crossover 1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)
-
Near optimal multiple sequence alignments using a traveling salesman problem approach 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)
-
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization Decision Making Theories and Practices from Analysis to Strategy
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].