Manoel B. Campêlo

Available identifiers

zbMath Open campelo.manoel-bMaRDI QIDQ1392563

List of research outcomes

Publication	Date of Publication	Type
Heuristics for the connected assignment problem in arrays	2023-11-23	Paper
Two dependency constrained spanning tree problems	2023-11-17	Paper
A parallel lagrangian heuristic for the fractional chromatic number of a graph	2023-09-19	Paper
A strongly polynomial algorithm for the minimum maximum flow degree problem	2023-06-27	Paper
A compact quadratic model and linearizations for the minimum linear arrangement problem	2022-11-02	Paper
Using the minimum maximum flow degree to approximate the flow coloring problem	2022-09-26	Paper
Correction to: ``Using the minimum maximum flow degree to approximate the flow coloring problem	2022-09-26	Paper
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem	2022-06-10	Paper
The geodesic classification problem on graphs	2022-04-27	Paper
The generalized dependency constrained spanning tree problem	2022-04-27	Paper
Integer programming approaches to the multiple team formation problem	2022-03-07	Paper
\(t\)-linearization for the maximum diversity problem	2021-09-28	Paper
An integer programming approach for solving a generalized version of the Grundy domination number	2021-06-14	Paper
Polyhedral study of the Convex Recoloring problem	2019-11-25	Paper
The polytope of legal sequences	2018-11-29	Paper
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations	2018-07-11	Paper
Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope	2018-05-24	Paper
Facets of the polytope of legal sequences	2018-04-09	Paper
Minimum linear arrangements	2018-04-09	Paper
A polyhedral study of the maximum stable set problem with weights on vertex-subsets	2016-06-22	Paper
The convex recoloring problem: polyhedra, facets and computational experiments	2016-04-04	Paper
On the complexity of the flow coloring problem	2015-09-30	Paper
Hardness and inapproximability of convex recoloring problems	2014-04-16	Paper
Unique lifting of integer variables in minimal inequalities	2013-11-11	Paper
A New Facet Generating Procedure for the Stable Set Polytope	2013-07-23	Paper
The Chvátal closure of generalized stable sets in bidirected graphs	2013-07-19	Paper
On the Complexity of Solving or Approximating Convex Recoloring Problems	2013-06-11	Paper
On optimal \(k\)-fold colorings of webs and antiwebs	2012-11-22	Paper
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems	2012-05-13	Paper
On Lifting Integer Variables in Minimal Inequalities	2010-06-22	Paper
Stable sets, corner polyhedra and the Chvàtal closure	2009-12-07	Paper
Cliques, holes and the vertex coloring polytope	2009-07-09	Paper
On the asymmetric representatives formulation for the vertex coloring problem	2008-04-16	Paper
https://portal.mardi4nfdi.de/entity/Q3439702	2007-05-29	Paper
A simplex approach for finding local solutions of a linear bilevel program by equilibrium points	2006-03-07	Paper
A study of local solutions in linear bilevel programming	2005-06-09	Paper
A computational study of global algorithms for linear bilevel programming	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q2768048	2002-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q2741478	2001-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q2741499	2001-10-24	Paper
A note on a modified simplex approach for solving bilevel linear programming problems	2000-11-05	Paper
A note on a penalty function approach for solving bilevel linear programs	2000-09-14	Paper
Maximum vertex-weighted matching in strongly chordal graphs	1998-07-28	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: Manoel B. Campêlo