Mark W. Lewis

According to our database, Mark W. Lewis authored at least 28 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers.

Yu Du, Gary A. Kochenberger, Fred W. Glover, Haibo Wang, Mark W. Lewis, Weihong Xie, Takeshi Tsuyuguchi

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

Penalty and partitioning techniques to improve performance of QUBO solvers.

Amit Verma, Mark W. Lewis

Discret. Optim., 2022

2021

Qfold: a new modeling paradigm for the RNA folding problem.

Mark W. Lewis, Amit Verma, Todd T. Eckdahl

J. Heuristics, 2021

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions.

Amit Verma, Mark W. Lewis, Gary A. Kochenberger

CoRR, 2021

QUBO transformation using Eigenvalue Decomposition.

Amit Verma, Mark W. Lewis

CoRR, 2021

Predicting 3D RNA Folding Patterns via Quadratic Binary Optimization.

Mark W. Lewis, Amit Verma, Rick Hennig

CoRR, 2021

Variable Reduction For Quadratic Unconstrained Binary Optimization.

Amit Verma, Mark W. Lewis

CoRR, 2021

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

Amit Verma, Mark W. Lewis

CoRR, 2021

Goal Seeking Quadratic Unconstrained Binary Optimization.

Amit Verma, Mark W. Lewis

CoRR, 2021

2020

Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions.

Amit Verma, Mark W. Lewis

Optim. Lett., 2020

2018

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

Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger

Eur. J. Oper. Res., 2018

2017

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

Mark W. Lewis, Fred W. Glover

Networks, 2017

Robust Optimization of Unconstrained Binary Quadratic Problems.

Mark W. Lewis, Gary A. Kochenberger, John Metcalfe

CoRR, 2017

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

Mark W. Lewis

CoRR, 2017

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

Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger

CoRR, 2017

2015

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

Gary A. Kochenberger, Mark W. Lewis, Fred W. Glover, Haibo Wang

Optim. Lett., 2015

2014

The unconstrained binary quadratic programming problem: a survey.

Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang

J. Comb. Optim., 2014

2013

Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation.

Mark W. Lewis, Gary A. Kochenberger

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

2012

SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic.

Mark W. Lewis, Barbara Jo White

INFOR Inf. Syst. Oper. Res., 2012

2010

A two-stage approach to solving large capacitated task allocation problems.

Mark W. Lewis, Gary A. Kochenberger

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.

Mark W. Lewis

Networks, 2009

Computationally attractive non-linear models for combinatorial optimisation.

Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang

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

Solving the market split problem via branch-and-cut.

Haibo Wang, Gary A. Kochenberger, Bahram Alidaee, Mark W. Lewis

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

2008

A new approach for modeling and solving set packing problems.

Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang

Eur. J. Oper. Res., 2008

A new modeling and solution approach for the set-partitioning problem.

Mark W. Lewis, Gary A. Kochenberger, Bahram Alidaee

Comput. Oper. Res., 2008

2006

Guided design search in the interval-bounded sailor assignment problem.

Mark W. Lewis, Karen R. Lewis, Barbara Jo White

Comput. Oper. Res., 2006

2005

Using <i>xQx</i> to model and solve the uncapacitated task allocation problem.

Mark W. Lewis, Bahram Alidaee, Gary A. Kochenberger

Oper. Res. Lett., 2005

2001

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

Jeffery L. Kennington, Mark W. Lewis

INFORMS J. Comput., 2001