Publication:3439711
From MaRDI portal
zbMath1203.90137MaRDI QIDQ3439711
Alexandre Pigatti, Eduardo Uchoa, Marcus Poggi de Aragão
Publication date: 29 May 2007
Related Items
Consistency Cuts for Dantzig-Wolfe Reformulations, A Survey of the Generalized Assignment Problem and Its Applications, A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks, An implementation of exact knapsack separation, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, An exact method with variable fixing for solving the generalized assignment problem, Chebyshev center based column generation, A computational study of exact knapsack separation for the generalized assignment problem, Accelerating the branch-and-price algorithm using machine learning, A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports, Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems, Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem, A cutting plane method for knapsack polytope, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, New approaches to nurse rostering benchmark instances
