Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem
Journal of Heuristics
A first multilevel cooperative algorithm for capacitated multicommodity network design
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A hub location problem with fully interconnected backbone and access networks
Computers and Operations Research
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Operations Research
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
INFORMS Journal on Computing
Computers and Operations Research
Reconstructing (0,1)-matrices from projections using integer programming
Computational Optimization and Applications
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Accelerating Benders Decomposition by Local Branching
INFORMS Journal on Computing
Large-Scale, Less-than-Truckload Service Network Design
Operations Research
A capacity scaling heuristic for the multicommodity capacitated network design problem
Journal of Computational and Applied Mathematics
A local branching heuristic for the capacitated fixed-charge network design problem
Computers and Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
Projected Perspective Reformulations with Applications in Design Problems
Operations Research
Relax-and-cut for capacitated network design
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient metaheuristics to solve the intermodal terminal location problem
Computers and Operations Research
Metric inequalities and the Network Loading Problem
Discrete Optimization
Piecewise-quadratic Approximations in Convex Numerical Optimization
SIAM Journal on Optimization
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Computational Optimization and Applications
| Hi-index | 0.00 |