Mariana S. Escalante

According to our database1, Mariana S. Escalante authored at least 30 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The minimum chromatic violation problem: A polyhedral approach.
Discret. Appl. Math., 2020

2017
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs.
Math. Program., 2017

Characterizing N+-perfect line graphs.
Int. Trans. Oper. Res., 2017

The minimum chromatic violation problem: a polyhedral study.
Electron. Notes Discret. Math., 2017

2016
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs.
Discret. Appl. Math., 2016

Lovász-Schrijver PSD-Operator on Claw-Free Graphs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity.
Ann. Oper. Res., 2015

2014
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope.
Discret. Appl. Math., 2014

On the facets of lift-and-project relaxations under graph operations.
Discret. Appl. Math., 2014

Lovász and Schrijver N_+ -Relaxation on Web Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs.
Electron. Notes Discret. Math., 2013

A note on the disjunctive index of joined a-perfect graphs.
Electron. Notes Discret. Math., 2013

The 2-dominating set polytope of cycles and related graph classes.
Electron. Notes Discret. Math., 2013

2012
Lift-and-project ranks of the set covering polytope of circulant matrices.
Discret. Appl. Math., 2012

2011
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs.
Electron. Notes Discret. Math., 2011

Near-perfect graphs with polyhedral N<sub>+</sub>(G).
Electron. Notes Discret. Math., 2011

Some advances on Lovász-Schrijver N<sub>+</sub>(⋅) relaxations of the fractional stable set polytope.
Electron. Notes Discret. Math., 2011

On the facets of the lift-and-project relaxations of graph subdivisions.
Electron. Notes Discret. Math., 2011

On the behavior of the N<sub>+</sub>-operator under blocker duality.
Discret. Appl. Math., 2011

2010
The Shapley value for arbitrary families of coalitions.
Eur. J. Oper. Res., 2010

A comparison between lift-and-project indices and imperfection ratio on web graphs.
Electron. Notes Discret. Math., 2010

On the k-dominating set polytope of web graphs.
Electron. Notes Discret. Math., 2010

A polyhedral approach to the stability of a family of coalitions.
Discret. Appl. Math., 2010

2009
Strength of facets for the set covering and set packing polyhedra on circulant matrices.
Electron. Notes Discret. Math., 2009

2006
Minimal <i>N</i><sub>+</sub>-rank graphs: Progress on Lipták and Tunçel's conjecture.
Oper. Res. Lett., 2006

On the commutativity of antiblocker diagrams under lift-and-project operators.
Discret. Appl. Math., 2006

2004
Note on Lift-and-Project Ranks and Antiblocker Duality.
Electron. Notes Discret. Math., 2004

On minimal N<sub>+</sub>- rank graphs.
Electron. Notes Discret. Math., 2004

2002
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index.
Math. Oper. Res., 2002

The disjunctive procedure and blocker duality.
Discret. Appl. Math., 2002


  Loading...