Pawel Jan Kalczynski

Morton E. O'Kelly

Malgorzata Miklas-Kalczynska

J. Oper. Res. Soc., August, 2024

Multiple obnoxious facility location: the case of protected areas.

[BibT_eX]

[DOI]

Comput. Manag. Sci., June, 2024

On the combined inverse-square effect of multiple points in multidimensional space.

[BibT_eX]

[DOI]

Keaton Coletti

Oper. Res. Lett., 2024

Different formulations of the gray pattern problem and their optimal solutions.

[BibT_eX]

[DOI]

Jack Brimberg

Eur. J. Oper. Res., 2024

2023

An Efficient Heuristic for the k-Partitioning Problem.

[BibT_eX]

[DOI]

Zvi Goldstein

Oper. Res. Forum, December, 2023

Extensions to the planar p-median problem.

[BibT_eX]

[DOI]

Richard L. Church

Ann. Oper. Res., July, 2023

The repeated <i>p</i>-dispersion problem.

[BibT_eX]

[DOI]

Jack Brimberg

INFOR Inf. Syst. Oper. Res., May, 2023

2022

Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Finding optimal solutions to several gray pattern instances.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Multiple obnoxious facilities with weighted demand points.

[BibT_eX]

[DOI]

Atsuo Suzuki

J. Oper. Res. Soc., 2022

2021

The obnoxious facilities planar p-median problem.

[BibT_eX]

[DOI]

OR Spectr., 2021

Directional approach to gradual cover: the continuous case.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2021

2020

Gradual cover competitive facility location.

[BibT_eX]

[DOI]

OR Spectr., 2020

Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

Multiple obnoxious facilities location: A cooperative model.

[BibT_eX]

[DOI]

IISE Trans., 2020

Obnoxious facility location: the case of weighted demand points.

[BibT_eX]

[DOI]

Atsuo Suzuki

CoRR, 2020

The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem.

[BibT_eX]

[DOI]

Jack Brimberg

CoRR, 2020

Directional approach to gradual cover: a maximin objective.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2020

2019

The planar multifacility collection depots location problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

Locating multiple facilities using the max-sum objective.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2019

2017

The continuous grey pattern problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2017

2016

The multiple markets competitive location problem.

[BibT_eX]

[DOI]

Kybernetes, 2016

2015

Price forecast valuation for the NYISO electricity market.

[BibT_eX]

[DOI]

Dawit Zerom

Kybernetes, 2015

A leader-follower model for discrete competitive facility location.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

Dynamic identification of anonymous consumers' visit goals using clickstream.

[BibT_eX]

[DOI]

Sylvain Senecal

Marc Fredette

Int. J. Electron. Bus., 2014

2012

Strategic competitive location: improving existing and establishing new facilities.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2012

A discrete model for optimal operation of fossil-fuel generators of electricity.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

A cover-based competitive location model.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2011

2009

An empirical analysis of the optimality rate of flow shop heuristics.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

2008

An improved NEH heuristic to minimize makespan in permutation flow shops.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

On no-wait and no-idle flow shops with makespan criterion.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

Predicting On-Line Task Completion with Clickstream Complexity Measures: A Graph-Based Approach.

[BibT_eX]

[DOI]

Sylvain Senecal

Jacques Nantel

Int. J. Electron. Commer., 2006

A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Technique for Reducing the Number of Rules in a Temporal Knowledge Base.

[BibT_eX]

[DOI]

Maria Antonina Mach

Proceedings of the Business Information Systems, 2006

2005

Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem.

[BibT_eX]

[DOI]

J. Sched., 2005

A Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem.

[BibT_eX]

[DOI]

J. Object Technol., 2005

Temporal Document Retrieval Model for business news archives.

[BibT_eX]

[DOI]

Amy Chou

Inf. Process. Manag., 2005

A heuristic for minimizing the makespan in no-idle permutation flow shops.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2005

Enhanced Knowledge Warehouse.

[BibT_eX]

[DOI]

Krzysztof Wecel

Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

2004

Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2004

2002

A Tool for Image Categorization to Support Information Filtering.

[BibT_eX]

Malgorzata Miklas-Kalczynska

Proceedings of the 11th Conference on Intelligent Systems: Emerging Technologies, 2002

Filtering the web to feed data warehouses.

[BibT_eX]

[DOI]

Krzysztof Wecel

Springer, ISBN: 978-1-85233-579-3, 2002

2001

Information Ants to Filter Business Information from Internet Sources.

[BibT_eX]