José Neto

Math. Program., November, 2024

The no-meet matroid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models.

[BibT_eX]

[DOI]

Quang Minh Bui

Margarida Carvalho

CoRR, 2024

2022

New bounds for subset selection from conic relaxations.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

A polyhedral view to a generalization of multiple domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

On the Performance of the ORTHOMADS Algorithm on Continuous and Mixed-Integer Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Optimization, Learning Algorithms and Applications, 2021

2020

A class of spectral bounds for Max k-Cut.

[BibT_eX]

[DOI]

Miguel F. Anjos

Discret. Appl. Math., 2020

2019

On <i>f</i>-domination: polyhedral and algorithmic results.

[BibT_eX]

[DOI]

Mauro Dell'Amico

Math. Methods Oper. Res., 2019

On fractional cut covers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On total f-domination: Polyhedral and algorithmic results.

[BibT_eX]

[DOI]

Mauro Dell'Amico

Discret. Appl. Math., 2019

Spectral bounds for graph partitioning with prescribed partition sizes.

[BibT_eX]

[DOI]

Miguel F. Anjos

Discret. Appl. Math., 2019

2018

On the most imbalanced orientation of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Complete formulations of polytopes related to extensions of assignment matrices.

[BibT_eX]

[DOI]

Discret. Optim., 2018

A Polyhedral View to Generalized Multiple Domination and Limited Packing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2016

Optimal Mapping of Cloud Virtual Machines.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

From Graph Orientation to the Unweighted Maximum Cut.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

The $$k$$ k -separator problem: polyhedra, complexity and approximation results.

[BibT_eX]

[DOI]

Mohamed-Ahmed Mohamed-Sidi

J. Comb. Optim., 2015

2014

On the polyhedral structure of uniform cut polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

The <i>k</i>-Separator Problem.

[BibT_eX]

[DOI]

Mohamed-Ahmed Mohamed-Sidi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

A simple finite cutting plane algorithm for integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

A gradient-based randomised heuristic for the maximum cut problem.

[BibT_eX]

[DOI]

Int. J. Math. Oper. Res., 2012

2011

From equipartition to uniform cut polytopes: Extended polyhedral results.

[BibT_eX]

[DOI]

Discret. Math., 2011

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.

[BibT_eX]

[DOI]

Andreas Bley