The following pages link to Paulo Barcia (Q922947):
Displaying 14 items.
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- The bound improving sequence algorithm (Q1061001) (← links)
- Constructive dual methods for discrete programming (Q1101341) (← links)
- A revised bound improvement sequence algorithm (Q1102193) (← links)
- Determining cutting stock patterns when defects are present (Q1270617) (← links)
- New polynomial bounds for matroidal knapsacks (Q1278377) (← links)
- Matroidal relaxations for 0-1 knapsack problems (Q1319682) (← links)
- Node packings on cocomparability graphs (Q1400341) (← links)
- \(k\)-colour partitions of acyclic tournaments (Q1773195) (← links)
- (Q1902887) (redirect page) (← links)
- Establishing determinantal inequalities for positive-definite matrices (Q1902888) (← links)
- Ordered matroids and regular independence systems (Q1918556) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- (Q4866688) (← links)
