The following pages link to Mark Lewis (Q405666):
Displayed 16 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- (Q499688) (redirect page) (← links)
- Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689) (← links)
- A two-stage approach to solving large capacitated task allocation problems (Q614188) (← links)
- A note on xQx as a modelling and solution framework for the linear ordering problem (Q840578) (← links)
- Computationally attractive nonlinear models for combinatorial optimisation (Q843386) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Guided design search in the interval-bounded sailor assignment problem (Q2581609) (← links)
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem (Q2627686) (← links)
- Solving the market split problem via branch-and-cut (Q2655892) (← links)
- The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis (Q2884505) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic (Q6102772) (← links)