Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
IEEE/ACM Transactions on Networking (TON)
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
Set-covering-based algorithms for the capacitated VRP
The vehicle routing problem
Combinatorial Optimization by Dynamic Contraction
Journal of Heuristics
Asynchronous Teams: Cooperation Schemes for Autonomous Agents
Journal of Heuristics
Computational Optimization and Applications
Perturbation heuristics for the pickup and delivery traveling salesman problem
Computers and Operations Research
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
On the Separation of Maximally Violated mod-k Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Automatic Data Layout Using 0-1 Integer Programming
PACT '94 Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
SCIL - Symbolic Constraints in Integer Linear Programming
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Parallel branch and cut for capacitated vehicle routing
Parallel Computing - Special issue: Parallel computing in logistics
An Application of Branch and Cut to Open Pit Mine Scheduling
Journal of Global Optimization
The one-commodity pickup-and-delivery travelling salesman problem
Combinatorial optimization - Eureka, you shrink!
An augment-and-branch-and-cut framework for mixed 0-1 programming
Combinatorial optimization - Eureka, you shrink!
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
The Journal of Supercomputing
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Journal of Network and Systems Management
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem
Transportation Science
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Undirected postman problems with zigzagging option: A cutting-plane approach
Computers and Operations Research
Computers and Industrial Engineering
Information Sciences: an International Journal
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments
Operations Research
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
Loosely coupled formulations for automated planning: an integer programming perspective
Journal of Artificial Intelligence Research
Information-theoretic approaches to branching in search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Multi-step methods for choosing the best set of variables in regression analysis
Computational Optimization and Applications
Technical and industrial issues of Advanced Planning and Scheduling (APS) systems
Computers in Industry
Applying simulated annealing for designing cellular manufacturing systems using MDmTSP
Computers and Industrial Engineering
Algorithms and theory of computation handbook
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
Analysis of the maximum level policy in a production-distribution system
Computers and Operations Research
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
Formulations and branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
INOC'11 Proceedings of the 5th international conference on Network optimization
INOC'11 Proceedings of the 5th international conference on Network optimization
Improving cutting plane generation with 0-1 inequalities by bi-criteria separation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A study of domino-parity and k-parity constraints for the TSP
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Solving survivable two-layer network design problems by metric inequalities
Computational Optimization and Applications
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Survey of facial results for the traveling salesman polytope
Mathematical and Computer Modelling: An International Journal
A note on branch-and-cut-and-price
Operations Research Letters
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters
Information-theoretic approaches to branching in search
Discrete Optimization
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
Symmetric ILP: Coloring and small integers
Discrete Optimization
Computers & Mathematics with Applications
A modified Lin-Kernighan traveling-salesman heuristic
Operations Research Letters
Operations Research Letters
DOE-based parameter tuning for local branching algorithm
International Journal of Metaheuristics
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
The exact solution of several classes of inventory-routing problems
Computers and Operations Research
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Making sensor networks immortal: an energy-renewal approach with wireless power transfer
IEEE/ACM Transactions on Networking (TON)
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm
Discrete Applied Mathematics
Discrete Applied Mathematics
Annals of Mathematics and Artificial Intelligence
A Market-based Solution to the Multiple Traveling Salesmen Problem
Journal of Intelligent and Robotic Systems
Discrete Tomography Data Footprint Reduction via Natural Compression
Fundamenta Informaticae - Strategies for Tomography
Optimal joint replenishment, delivery and inventory management policies for perishable products
Computers and Operations Research
| Hi-index | 0.00 |