scientific article
From MaRDI portal
Publication:3439711
zbMath1203.90137MaRDI QIDQ3439711
Alexandre Pigatti, Eduardo Uchoa, Marcus Poggi de Aragão
Publication date: 29 May 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (15)
Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ An implementation of exact knapsack separation ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ A cutting plane method for knapsack polytope ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation ⋮ 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 ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ New approaches to nurse rostering benchmark instances ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ Chebyshev center based column generation ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
This page was built for publication:
