Back to Results
First PageMeta Content
Computational complexity theory / Mathematical optimization / Constraint programming / Quadratic programming / Linear programming / Semidefinite programming / Local consistency / Knapsack problem / Constraint satisfaction / Operations research / Theoretical computer science / Applied mathematics


Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron
Add to Reading List

Document Date: 2015-01-28 09:11:33


Open Document

File Size: 257,70 KB

Share Result on Facebook

City

Discrete Ellipsoid / Berlin / /

Company

SIAM Journal / Renewable Energy / Intel / EURO Journal / /

/

Facility

Industrial Engineering University of Toronto / /

IndustryTerm

search strategies / search process / communications literature / solver software / ellipsoid-based search / online solver / search proceeds / reduction algorithms / search starts / search interval / real world applications / search strategy / Wireless Communications / search tree / integer solution / branch-and-bound algorithm / feasible integer solution / linear constraint propagation algorithms / search moves / search space / search algorithm / bound algorithm / /

OperatingSystem

MAC OS X / /

Organization

University of Toronto / Toronto / Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical / /

Person

Gallego / J. Christopher Beck / /

Technology

reduction algorithms / DEBS search algorithm / artificial intelligence / Wireless Communications / GPS / Approximation algorithms / linear constraint propagation algorithms / branch-and-bound algorithm / /

URL

http /

SocialTag