Manoel B. Campêlo

According to our database1, Manoel B. Campêlo authored at least 42 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Two dependency constrained spanning tree problems.
Int. Trans. Oper. Res., 2020

A Unifying Model for Locally Constrained Spanning Tree Problems.
CoRR, 2020

The sociotechnical teams formation problem: a mathematical optimization approach.
Ann. Oper. Res., 2020

2019
The Generalized Dependency Constrained Spanning Tree Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The Geodesic Classification Problem on Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

An integer programming approach for solving a generalized version of the Grundy domination number.
CoRR, 2019

Polyhedral study of the Convex Recoloring problem.
CoRR, 2019

2018
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015.
Discret. Appl. Math., 2018

The polytope of legal sequences.
CoRR, 2018

2017
Facets of the polytope of legal sequences.
Electron. Notes Discret. Math., 2017

Minimum Linear Arrangements.
Electron. Notes Discret. Math., 2017

Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations.
Comput. Oper. Res., 2017

2016
The convex recoloring problem: polyhedra, facets and computational experiments.
Math. Program., 2016

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope.
Discret. Optim., 2016

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.
Discret. Appl. Math., 2016

2015
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.
Electron. Notes Discret. Math., 2015

On the complexity of the flow coloring problem.
Discret. Appl. Math., 2015

Facet-defining inequalities for the representatives k-fold coloring polytope.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Convex recoloring: inapproximability and a polyhedral study.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Hardness and inapproximability of convex recoloring problems.
Theor. Comput. Sci., 2014

2013
Unique lifting of integer variables in minimal inequalities.
Math. Program., 2013

On the representatives k-fold coloring polytope.
Electron. Notes Discret. Math., 2013

Polyhedral studies on the convex recoloring problem.
Electron. Notes Discret. Math., 2013

On optimal k-fold colorings of webs and antiwebs.
Discret. Appl. Math., 2013

On the Complexity of Solving or Approximating Convex Recoloring Problems.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Power allocation schemes for multichannel two-hop relaying systems.
Proceedings of the 2012 International Symposium on Wireless Communication Systems (ISWCS), 2012

2011
A New Facet Generating Procedure for the Stable Set Polytope.
Electron. Notes Discret. Math., 2011

2010
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems.
Electron. Notes Discret. Math., 2010

On Lifting Integer Variables in Minimal Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Stable sets, corner polyhedra and the Chvátal closure.
Oper. Res. Lett., 2009

The Chvátal closure of generalized stable sets in bidirected graphs.
Electron. Notes Discret. Math., 2009

A Lagrangian Relaxation for the Maximum Stable Set Problem
CoRR, 2009

2008
Recent Hybrid Techniques for the Multi-Knapsack Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2005
On the asymmetric representatives formulation for the vertex coloring problem.
Electron. Notes Discret. Math., 2005

A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points.
Ann. Oper. Res., 2005

2004
A Computational Study of Global Algorithms for Linear Bilevel Programming.
Numer. Algorithms, 2004

Cliques, holes and the vertex coloring polytope.
Inf. Process. Lett., 2004

2001
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.
Electron. Notes Discret. Math., 2001

Add/Drop Procedures for the Capacitated Plant Location Problem.
Electron. Notes Discret. Math., 2001

2000
A Note on a Penalty Function Approach for Solving Bilevel Linear Programs.
J. Glob. Optim., 2000

A note on a modified simplex approach for solving bilevel linear programming problems.
Eur. J. Oper. Res., 2000

1998
Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
Discret. Appl. Math., 1998


  Loading...