# Mark W. Lewis

According to our database

Collaborative distances:

^{1}, Mark W. Lewis authored at least 26 papers between 2001 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

J. Heuristics, 2021

CoRR, 2021

CoRR, 2021

CoRR, 2021

CoRR, 2021

Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems.

CoRR, 2021

CoRR, 2021

2020

Optim. Lett., 2020

2018

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems.

Eur. J. Oper. Res., 2018

2017

Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis.

Networks, 2017

CoRR, 2017

A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit.

CoRR, 2017

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems.

CoRR, 2017

2015

Exact solutions to generalized vertex covering problems: a comparison of two models.

Optim. Lett., 2015

2014

J. Comb. Optim., 2014

2013

Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation.

Int. J. Inf. Technol. Decis. Mak., 2013

2012

INFOR Inf. Syst. Oper. Res., 2012

2010

Int. J. Math. Model. Numer. Optimisation, 2010

2009

On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem.

Networks, 2009

Int. J. Math. Oper. Res., 2009

Int. J. Math. Model. Numer. Optimisation, 2009

2008

Eur. J. Oper. Res., 2008

Comput. Oper. Res., 2008

2006

Comput. Oper. Res., 2006

2005

Oper. Res. Lett., 2005

2001

The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis.

INFORMS J. Comput., 2001