Marcos Colebrook

Orcid: 0000-0003-3074-1697

According to our database1, Marcos Colebrook authored at least 17 papers between 1999 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
CURIE: Towards an Ontology and Enterprise Architecture of a CRM Conceptual Model.
Bus. Inf. Syst. Eng., 2022

2019
Developing a data analytics platform to support decision making in emergency and security management.
Expert Syst. Appl., 2019

A biobjective Dijkstra algorithm.
Eur. J. Oper. Res., 2019

NanoDJ: a Dockerized Jupyter notebook for interactive Oxford Nanopore MinION sequence manipulation and genome assembly.
BMC Bioinform., 2019

2016
Centralized and decentralized inventory policies for a single-vendor two-buyer system with permissible delay in payments.
Comput. Oper. Res., 2016

2015
IonGAP: integrative bacterial genome analysis for Ion Torrent sequence data.
Bioinform., 2015

2013
Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities.
Comput. Oper. Res., 2013

2009
Optimality conditions in preference-based spanning tree problems.
Eur. J. Oper. Res., 2009

2008
An efficient approach for solving the lot-sizing problem with time-varying storage capacities.
Eur. J. Oper. Res., 2008

2007
A polynomial algorithm for the multicriteria cent-dian location problem.
Eur. J. Oper. Res., 2007

A polynomial algorithm for the production/ordering planning problem with limited storage.
Comput. Oper. Res., 2007

Undesirable facility location problems on multicriteria networks.
Comput. Oper. Res., 2007

2006
An O(mn) algorithm for the anti-cent-dian problem.
Appl. Math. Comput., 2006

2005
A new bound and an O(<i>mn</i>) algorithm for the undesirable 1-median problem (maxian) on networks.
Comput. Oper. Res., 2005

2003
A new characterization for the dynamic lot size problem with bounded inventory.
Comput. Oper. Res., 2003

2002
A new algorithm for the undesirable 1-center problem on networks.
J. Oper. Res. Soc., 2002

1999
Locating a facility on a network with multiple median-type objectives.
Ann. Oper. Res., 1999


  Loading...