Paulo Bárcia

According to our database, Paulo Bárcia authored at least 9 papers between 1987 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

The <i>k</i>-Track Assignment Problem on Partial Orders.

Paulo Bárcia, J. Orestes Cerdeira

J. Sched., 2005

k-Colour Partitions of Acyclic Tournaments.

Paulo Bárcia, J. Orestes Cerdeira

Electron. J. Comb., 2005

2003

Node packings on cocomparability graphs.

Paulo Bárcia, J. Orestes Cerdeira

Oper. Res. Lett., 2003

1998

Determining cutting stock patternswhen defects are present.

Ronny Aboudi, Paulo Bárcia

Ann. Oper. Res., 1998

1996

Ordered matroids and regular independence systems.

J. Orestes Cerdeira, Paulo Bárcia

Discret. Math., 1996

1995

Establishing Determinantal Inequalities for Positive-definite Matrices.

J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia

Discret. Appl. Math., 1995

1994

A bound-improving approach to discrete programming problems.

Paulo Bárcia, J. D. Coelho

Math. Program., 1994

1993

Matroidal relaxations for 0-1 knapsack problems.

Lígia Amado, Paulo Bárcia

Oper. Res. Lett., 1993

1987

Constructive dual methods for discrete programming.

Paulo Bárcia

Discret. Appl. Math., 1987