Back to Results
First PageMeta Content
Software engineering / Applied mathematics / Convex optimization / Linear programming / Constraint satisfaction / Local consistency / Cutting-plane method / Relaxation / Constraint programming / Operations research / Mathematical optimization


Reconsidering Mixed Integer Programming and MIP-based Hybrids for Scheduling Stefan Heinz1,? and J. Christopher Beck2 1 Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany
Add to Reading List

Document Date: 2012-03-15 06:47:14

Open Document

File Size: 357,34 KB

Share Result on Facebook

City

Berlin / /

Company

IBM / J. Christopher Beck / Intel / /

Country

Germany / Canada / /

/

Facility

Zuse Institute / Industrial Engineering University of Toronto / /

IndustryTerm

default search / search node / intermediate feasible solutions / constraint-specific inference algorithms / feasible solution / feasible master solution / branch-andbound search / default branch-and-bound search / bound search / feasible solutions / good feasible solutions / /

OperatingSystem

Linux / /

Organization

University of Toronto / Toronto / Zuse Institute Berlin / Department of Mechanical / /

Person

Stefan Heinz / Scheduling Stefan / Constraint Integer / Table / /

Position

model / MP / programming model / ILOG Scheduler / /

Product

Pentax K-x Digital Camera / IloAlternative / SPs / /

ProgrammingLanguage

J / K / /

ProvinceOrState

Ontario / /

Technology

Linux / hybridization / constraint-specific inference algorithms / key technologies / /

SocialTag