Javier Marenco

According to our database1, Javier Marenco authored at least 53 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Facets based on cycles and cliques for the acyclic coloring polytope.
RAIRO Oper. Res., 2020

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

2019
Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope.
RAIRO Oper. Res., 2019

The 2D Subarray Polytope.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

An Integer Programming Approach for the 2-class Single-group Classification Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Facet-generating Procedures for the Maximum-impact Coloring Polytope.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

An integer programming approach to b-coloring.
Discret. Optim., 2019

On the combinatorics of the 2-class classification problem.
Discret. Optim., 2019

Computing the P3-hull number of a graph, a polyhedral approach.
Discret. Appl. Math., 2019

2018
General cut-generating procedures for the stable set polytope.
Discret. Appl. Math., 2018

The Distance Polytope for the Vertex Coloring Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
The maximum-impact coloring polytope.
Int. Trans. Oper. Res., 2017

Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model.
Electron. Notes Discret. Math., 2017

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

An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools.
Ann. Oper. Res., 2017

2016
Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope.
RAIRO Oper. Res., 2016

Polyhedral studies of vertex coloring problems: The standard formulation.
Discret. Optim., 2016

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

2015
Topological additive numbering of directed acyclic graphs.
Inf. Process. Lett., 2015

The caterpillar-packing polytope.
Electron. Notes Discret. Math., 2015

A Strengthened General Cut-Generating Procedure for the Stable Set Polytope.
Electron. Notes Discret. Math., 2015

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR, 2015

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

2014
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game.
Int. Trans. Oper. Res., 2014

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math., 2014

2013
An approach for efficient ship routing.
Int. Trans. Oper. Res., 2013

Mathematical models for optimizing production chain planning in salmon farming.
Int. Trans. Oper. Res., 2013

Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.
Interfaces, 2013

Additive Coloring with Fixed Orientations.
CoRR, 2013

2012
An Application of the Traveling Tournament Problem: The Argentine Volleyball League.
Interfaces, 2012

A polyhedral study of the acyclic coloring problem.
Discret. Appl. Math., 2012

2011
Envy-free division of discrete cakes.
Electron. Notes Discret. Math., 2011

Combinatorial properties and further facets of maximum edge subgraph polytopes.
Electron. Notes Discret. Math., 2011

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

Solving the segmentation problem for the 2010 Argentine census with integer programming.
Electron. Notes Discret. Math., 2011

Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope.
Electron. Notes Discret. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2011

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.
Discret. Optim., 2011

Minimum sum set coloring of trees and line graphs of trees.
Discret. Appl. Math., 2011

The Full Strategy Minority Game
CoRR, 2011

2009
On the b-Coloring of Cographs and <i>P</i><sub>4</sub>-Sparse Graphs.
Graphs Comb., 2009

A polyhedral study of the acyclic coloring problem.
Electron. Notes Discret. Math., 2009

A polyhedral study of the maximum edge subgraph problem.
Electron. Notes Discret. Math., 2009

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Discret. Optim., 2009

Cycle-based facets of chromatic scheduling polytopes.
Discret. Optim., 2009

Minimum Sum Set Coloring on some Subclasses of Block Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
The Football Pool Polytope.
Electron. Notes Discret. Math., 2008

2007
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
Ann. Oper. Res., 2007

2006
Exploring the complexity boundary between coloring and list-coloring.
Electron. Notes Discret. Math., 2006

On the combinatorial structure of chromatic scheduling polytopes.
Discret. Appl. Math., 2006

2005
The combinatorial stages of chromatic scheduling polytopes.
Electron. Notes Discret. Math., 2005

2004
Combinatorial equivalence of Chromatic Scheduling Polytopes.
Electron. Notes Discret. Math., 2004

2002
Facets of the Graph Coloring Polytope.
Ann. Oper. Res., 2002


  Loading...