scientific article; zbMATH DE number 5158528
From MaRDI portal
Publication:3439711
zbMATH Open1203.90137MaRDI QIDQ3439711FDOQ3439711
Authors: Alexandre Pigatti, Marcus Poggi de Aragão, Eduardo Uchoa 
Publication date: 29 May 2007
Title of this publication is not available (Why is that?)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cited In (15)
- A cutting plane method for knapsack polytope
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Consistency cuts for Dantzig-Wolfe reformulations
- A Survey of the Generalized Assignment Problem and Its Applications
- Accelerating the branch-and-price algorithm using machine learning
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- An implementation of exact knapsack separation
- Chebyshev center based column generation
- New approaches to nurse rostering benchmark instances
- An exact method with variable fixing for solving the generalized assignment problem
- A computational study of exact knapsack separation for the generalized assignment problem
- 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
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439711)
