Back to Results
First PageMeta Content
Combinatorics / Heuristic / A* search algorithm / Mathematical optimization / Dynamic programming / Greedy algorithm / Capacitated minimum spanning tree / Operations research / Mathematics / Applied mathematics


OPERATIONS RESEARCH informs
Add to Reading List

Document Date: 2008-05-16 07:44:38

Open Document

File Size: 172,00 KB

Share Result on Facebook

Company

Procter & Gamble / Literature Review / CPLEX / Salomon / Tdi / BASF / /

/

Event

FDA Phase / /

Facility

Tel Aviv University / Uris Hall / library of XPRESS / Columbia University / Plant w/cuts / /

IndustryTerm

found solution / Polynomial time algorithms / close-to-optimal solution / faster solutions / manufacturing resource planning systems / minimum cost network / feasible solution / significantly better solutions / close-tooptimal solutions / exponential search algorithm / significantly superior solutions / close-to-optimal solutions / dynamic programming algorithm / heuristic solutions / /

OperatingSystem

Solaris / /

Organization

Lancaster University Management School / Columbia University / Graduate School / Joern Meissner Department of Management Science / Tel Aviv University / Michal Tzur Department of Industrial Engineering / /

Person

Van Hoesel / Van Nunen / Lin / Van Wassenhove / Lot-Sizing Problems Awi Federgruen / Maes Wassenhove / Lot-Sizing Problems / Chung / Michal Tzur / /

/

Position

General / /

Product

II / Phase / IT0l / /

ProgrammingLanguage

C++ / /

PublishedMedium

the CPU times / /

Technology

RAM / dynamic programming algorithm / exponential search algorithm / Polynomial time algorithms / /

SocialTag