Carlos E. Ferreira

From MaRDI portal
Person:324739

Available identifiers

zbMath Open ferreira.carlos-eduardoWikidataQ96606948 ScholiaQ96606948MaRDI QIDQ324739

List of research outcomes

PublicationDate of PublicationType
Optimal Boolean lattice-based algorithms for the U-curve optimization problem2020-09-22Paper
Prices of Anarchy of Selfish 2D Bin Packing Games2019-06-21Paper
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem2019-05-17Paper
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem2018-05-24Paper
A \(\min\)-\(\max\) relation in flowgraphs and some applications2018-05-24Paper
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem2017-06-19Paper
A min-max relation in flowgraphs2016-10-17Paper
The Envy-Free Pricing Problem and Unit-Demand Markets2015-10-16Paper
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs2015-09-22Paper
Algorithms for Junctions in Acyclic Digraphs2015-07-22Paper
PTAS’s for Some Metric p-source Communication Spanning Tree Problems2015-02-27Paper
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem2015-02-19Paper
A dynamic programming algorithm for the tree mapping problem2013-07-23Paper
Selfish Square Packing2013-07-23Paper
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design2013-04-09Paper
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone2012-11-02Paper
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics2012-05-13Paper
A branch-and-cut approach to the repetition-free longest common subsequence problem2012-05-13Paper
Repetition-free longest common subsequence2010-08-13Paper
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem2010-03-24Paper
Repetition-free longest common subsequence2008-06-05Paper
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant2008-04-15Paper
Estimates for the spreading velocity of an epidemic model.2004-03-29Paper
Rearrangement of DNA fragments: a branch-and-cut algorithm.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27414962001-10-24Paper
A combinatorial optimization technique for the sequential decomposition of erosions and dilations2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42275441999-06-29Paper
The node capacitated graph partitioning problem: A computational study1999-06-03Paper
Decomposing Matrices into Blocks1999-02-22Paper
Solving Multiple Knapsack Problems by Cutting Planes1997-02-03Paper
Formulations and valid inequalities of the node capacitated graph partitioning problem1996-10-31Paper
https://portal.mardi4nfdi.de/entity/Q48599541996-01-14Paper
Some integer programs arising in the design of main frame computers1993-09-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Carlos E. Ferreira