An integer local search method with application to capacitated production planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure
Computational Optimization and Applications
Network Dimensioning with MPLS
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Budget constrained location problem with opening and closing of facilities
Computers and Operations Research
Models and Algorithms for Integration of Vehicle and Crew Scheduling
Journal of Scheduling
Lagrangian heuristics for the linear ordering problem
Metaheuristics
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Computers and Operations Research
Bound sets for biobjective combinatorial optimization problems
Computers and Operations Research
The Optimal Diversity Management Problem
Operations Research
A Relax-and-Cut algorithm for the set partitioning problem
Computers and Operations Research
Lower and upper bounds for a two-level hierarchical location problem in computer networks
Computers and Operations Research
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Benders decomposition, Lagrangean relaxation and metaheuristic design
Journal of Heuristics
Computers and Operations Research
Using scenario trees and progressive hedging for stochastic inventory routing problems
Journal of Heuristics
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Lagrangian heuristic for a class of the generalized assignment problems
Computers & Mathematics with Applications
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
A Lagrangian approach for minimum cost single round robin tournaments
Computers and Operations Research
The minimum stabbing triangulation problem: IP models and computational evaluation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem
Journal of Intelligent Manufacturing
Heuristics for the single source capacitated multi-facility Weber problem
Computers and Industrial Engineering
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
Computers and Operations Research
A Lagrangian heuristic for sprint planning in agile software development
Computers and Operations Research
Hi-index | 0.00 |