Paulo Barcia
Paulo Barcia
Dirección de correo verificada de fe.unl.pt
Título
Citado por
Citado por
Año
Improved Lagrangean decomposition: An application to the generalized assignment problem
P Barcia, K Jörnsten
European Journal of Operational Research 46 (1), 84-92, 1990
461990
The bound improving sequence algorithm
P Barcia
Operations research letters 4 (1), 27-30, 1985
211985
Tracing the flows of electricity
P Barcia, R Pestana
International Journal of Electrical Power & Energy Systems 32 (4), 329-332, 2010
202010
Constructive dual methods for discrete programming
P Barcia
Discrete applied mathematics 18 (2), 107-117, 1987
181987
Stable isotopes as ecological tracers: an efficient method for assessing the contribution of multiple sources to mixtures
MN Bugalho, P Barcia, MC Caldeira, JO Cerdeira
Biogeosciences 5 (5), 1351-1359, 2008
152008
Determining cutting stock patternswhen defects are present
R Aboudi, P Barcia
Annals of Operations Research 82, 343-354, 1998
151998
A revised bound improvement sequence algorithm
P Barcia, S Holm
European journal of operational research 36 (2), 202-206, 1988
151988
Using n-alkanes to estimate diet composition of herbivores: a novel mathematical approach
P Barcia, MN Bugalho, ML Campagnolo, JO Cerdeira
animal 1 (1), 141-149, 2007
112007
Node packings on cocomparability graphs
P Barcia, JO Cerdeira
Operations Research Letters 31 (5), 341-342, 2003
62003
Matroidal relaxations for 0–1 knapsack problems
L Amado, P Barcia
Operations research letters 14 (3), 147-152, 1993
61993
A decision support system (DSS) for power generation
LV Tavares, V Vieira, P Bárcia
European journal of operational research 25 (3), 373-394, 1986
61986
The k-track assignment problem on partial orders
P Barcia, JO Cerdeira
Journal of Scheduling 8 (2), 135-143, 2005
52005
New polynomial bounds for matroidal knapsacks
L Amado, P Barcia
European journal of operational research 95 (1), 201-210, 1996
51996
When is a 0-1 knapsack a matroid?
JO Cerdeira, P Barcia
Portugaliae Mathematica 52 (4), 475-480, 1995
41995
Métodos de reforço do dual em programação inteira
P Bárcia
41985
Ordered matroids and regular independence systems
JO Cerdeira, P Barcia
Discrete Mathematics 154 (1-3), 255-261, 1996
21996
Improving Lagrangean decomposition: Some theoretical results
P Bárcia
Nova SBE, 1988
11988
Bound Improving Sequences: A Tool for Discrete Programming
P Bárcia
Nova SBE, 1984
11984
generalize the previous theory for the case of non-linear discrete
P Bárcia, JD Coelho
Algorithms and Model Formulations in Mathematical Programming 51, 144, 2012
2012
-Colour Partitions of Acyclic Tournaments
P Barcia, JO Cerdeira
the electronic journal of combinatorics, R5-R5, 2005
2005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20