Barcia Paulo

Paulo Barcia

Information about the author Paulo Barcia will soon be added to the site.
Found 6 papers in total
The k-track assignment problem on partial orders
The k-track assignment problem on partial orders
2005
The k-track assignment problem is a scheduling problem in which a collection of jobs,...
Node packings on cocomparability graphs
Node packings on cocomparability graphs
2003
We give a compact formulation for the clique inequalities defining the fractional node...
New polynomial bounds for matroidal knapsacks
New polynomial bounds for matroidal knapsacks
1996
The Matroidal Knapsack Problem (MK) consists in finding the maximum weight basis for a...
Determining cutting stock patterns when defects are present
Determining cutting stock patterns when defects are present
1998
This paper investigates the problem of obtaining the best arrangement for cutting...
Matroidal relaxations for 0-1 knapsack problems
Matroidal relaxations for 0-1 knapsack problems
1993
The family of the feasible solutions for a Knapsack with positive coefficients, , is...
Improved Lagrangean decomposition: An application to the generalized assignment problem
Improved Lagrangean decomposition: An application to the generalized assignment problem
1990
Recently two new ways of obtaining improved Lagrangean bounds have been suggested:...
Papers per page: