Javier Marenco
Orcid: 0000-0003-2694-4758Affiliations:
- National University of General Sarmiento, Argentina
 
  According to our database1,
  Javier Marenco
  authored at least 75 papers
  between 2002 and 2025.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
- 
    on orcid.org
 
On csauthors.net:
Bibliography
  2025
    Oper. Res. Forum, September, 2025
    
  
    Central Eur. J. Oper. Res., September, 2025
    
  
A branch-and-price algorithm for the hyper-rectangular clustering problem with axis-parallel clusters and outliers.
    
  
    Comput. Optim. Appl., March, 2025
    
  
    Discret. Appl. Math., 2025
    
  
  2024
An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters.
    
  
    CoRR, 2024
    
  
    Proceedings of the L Latin American Computer Conference, 2024
    
  
  2023
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers.
    
  
    Discret. Appl. Math., December, 2023
    
  
    Discret. Appl. Math., November, 2023
    
  
    Discret. Appl. Math., October, 2023
    
  
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).
    
  
    Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
    
  
    Proceedings of the XLIX Latin American Computer Conference, 2023
    
  
  2022
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations.
    
  
    Discret. Appl. Math., 2022
    
  
    Discret. Appl. Math., 2022
    
  
Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques.
    
  
    Ann. Oper. Res., 2022
    
  
  2021
Scheduling Multiple Sports Leagues with Travel Distance Fairness: An Application to Argentinean Youth Football.
    
  
    INFORMS J. Appl. Anal., 2021
    
  
    INFORMS J. Appl. Anal., 2021
    
  
Machine learning for improving performance in an evolutionary algorithm for minimum path with uncertain costs given by massively simulated scenarios.
    
  
    CoRR, 2021
    
  
Valid inequalities and complete characterizations of the 2-domination and the <i>P</i><sub>3</sub>-hull number polytopes.
    
  
    Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
    
  
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem.
    
  
    Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
    
  
  2020
    RAIRO Oper. Res., 2020
    
  
    Discret. Appl. Math., 2020
    
  
  2019
Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope.
    
  
    RAIRO Oper. Res., 2019
    
  
Scheduling Argentina's professional basketball leagues: A variation on the Travelling Tournament Problem.
    
  
    Eur. J. Oper. Res., 2019
    
  
    Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
    
  
    Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
    
  
    Discret. Appl. Math., 2019
    
  
  2018
    Discret. Appl. Math., 2018
    
  
    Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
    
  
  2017
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model.
    
  
    Electron. Notes Discret. Math., 2017
    
  
    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
    
  
    Discret. Optim., 2016
    
  
    Discret. Appl. Math., 2016
    
  
  2015
    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
    Int. Trans. Oper. Res., 2013
    
  
Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.
    
  
    Interfaces, 2013
    
  
  2012
    Interfaces, 2012
    
  
  2011
    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
    
  
    Electron. Notes Discret. Math., 2011
    
  
    Discret. Optim., 2011
    
  
    Discret. Appl. Math., 2011
    
  
  2009
    Graphs Comb., 2009
    
  
    Electron. Notes Discret. Math., 2009
    
  
    Electron. Notes Discret. Math., 2009
    
  
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
    
  
    Discret. Optim., 2009
    
  
    Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
    
  
  2008
  2007
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
    
  
    Ann. Oper. Res., 2007
    
  
  2006
    Electron. Notes Discret. Math., 2006
    
  
    Discret. Appl. Math., 2006
    
  
  2005
    Electron. Notes Discret. Math., 2005
    
  
  2004
    Electron. Notes Discret. Math., 2004
    
  
  2002