The following pages link to Carlos E. Ferreira (Q324739):
Displaying 34 items.
- (Q233444) (redirect page) (← links)
- A min-max relation in flowgraphs (Q324741) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Estimates for the spreading velocity of an epidemic model. (Q1428710) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- A combinatorial optimization technique for the sequential decomposition of erosions and dilations (Q1856215) (← links)
- Optimal Boolean lattice-based algorithms for the U-curve optimization problem (Q2200667) (← links)
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- DNA fragments assembly programs: A comparative study (Q2741496) (← links)
- A dynamic programming algorithm for the tree mapping problem (Q2840699) (← links)
- Selfish square packing (Q2840737) (← links)
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone (Q3167622) (← links)
- The Envy-Free Pricing Problem and Unit-Demand Markets (Q3195332) (← links)
- (Q4227544) (← links)
- Decomposing Matrices into Blocks (Q4229489) (← links)
- (Q4859954) (← links)
- Solving Multiple Knapsack Problems by Cutting Planes (Q4895625) (← links)
- Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design (Q4915175) (← links)
- A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem (Q5174945) (← links)
- PTAS’s for Some Metric p-source Communication Spanning Tree Problems (Q5176579) (← links)
- Algorithms for Junctions in Acyclic Digraphs (Q5265169) (← links)
- Prices of Anarchy of Selfish 2D Bin Packing Games (Q5384121) (← links)
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant (Q5458540) (← links)
- Repetition-free longest common subsequence (Q5900087) (← links)
- Repetition-free longest common subsequence (Q5901069) (← links)
- Rearrangement of DNA fragments: a branch-and-cut algorithm. (Q5957304) (← links)
