Mark W. Lewis

According to our database1, Mark W. Lewis authored at least 26 papers between 2001 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Qfold: a new modeling paradigm for the RNA folding problem.
J. Heuristics, 2021

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions.
CoRR, 2021

QUBO transformation using Eigenvalue Decomposition.
CoRR, 2021

Predicting 3D RNA Folding Patterns via Quadratic Binary Optimization.
CoRR, 2021

Variable Reduction For Quadratic Unconstrained Binary Optimization.
CoRR, 2021

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

Goal Seeking Quadratic Unconstrained Binary Optimization.
CoRR, 2021

2020
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions.
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

Robust Optimization of Unconstrained Binary Quadratic Problems.
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
The unconstrained binary quadratic programming problem: a survey.
J. Comb. Optim., 2014

2013
Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation.
Int. J. Inf. Technol. Decis. Mak., 2013

2012
SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic.
INFOR Inf. Syst. Oper. Res., 2012

2010
A two-stage approach to solving large capacitated task allocation problems.
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

Computationally attractive non-linear models for combinatorial optimisation.
Int. J. Math. Oper. Res., 2009

Solving the market split problem via branch-and-cut.
Int. J. Math. Model. Numer. Optimisation, 2009

2008
A new approach for modeling and solving set packing problems.
Eur. J. Oper. Res., 2008

A new modeling and solution approach for the set-partitioning problem.
Comput. Oper. Res., 2008

2006
Guided design search in the interval-bounded sailor assignment problem.
Comput. Oper. Res., 2006

2005
Using <i>xQx</i> to model and solve the uncapacitated task allocation problem.
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


  Loading...