Carlos E. Ferreira

Available identifiers

zbMath Open ferreira.carlos-eduardoWikidataQ96606948 ScholiaQ96606948MaRDI QIDQ324739

List of research outcomes

Publication	Date of Publication	Type
Optimal Boolean lattice-based algorithms for the U-curve optimization problem	2020-09-22	Paper
Prices of Anarchy of Selfish 2D Bin Packing Games	2019-06-21	Paper
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem	2019-05-17	Paper
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem	2018-05-24	Paper
A \(\min\)-\(\max\) relation in flowgraphs and some applications	2018-05-24	Paper
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem	2017-06-19	Paper
A min-max relation in flowgraphs	2016-10-17	Paper
The Envy-Free Pricing Problem and Unit-Demand Markets	2015-10-16	Paper
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs	2015-09-22	Paper
Algorithms for Junctions in Acyclic Digraphs	2015-07-22	Paper
PTAS’s for Some Metric p-source Communication Spanning Tree Problems	2015-02-27	Paper
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem	2015-02-19	Paper
A dynamic programming algorithm for the tree mapping problem	2013-07-23	Paper
Selfish Square Packing	2013-07-23	Paper
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design	2013-04-09	Paper
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone	2012-11-02	Paper
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics	2012-05-13	Paper
A branch-and-cut approach to the repetition-free longest common subsequence problem	2012-05-13	Paper
Repetition-free longest common subsequence	2010-08-13	Paper
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem	2010-03-24	Paper
Repetition-free longest common subsequence	2008-06-05	Paper
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant	2008-04-15	Paper
Estimates for the spreading velocity of an epidemic model.	2004-03-29	Paper
Rearrangement of DNA fragments: a branch-and-cut algorithm.	2002-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q2741496	2001-10-24	Paper
A combinatorial optimization technique for the sequential decomposition of erosions and dilations	2000-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4227544	1999-06-29	Paper
The node capacitated graph partitioning problem: A computational study	1999-06-03	Paper
Decomposing Matrices into Blocks	1999-02-22	Paper
Solving Multiple Knapsack Problems by Cutting Planes	1997-02-03	Paper
Formulations and valid inequalities of the node capacitated graph partitioning problem	1996-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q4859954	1996-01-14	Paper
Some integer programs arising in the design of main frame computers	1993-09-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Carlos E. Ferreira