Back to Results
First PageMeta Content
Inequality / Applied mathematics / Combinatory logic / Linear programming / Cauchy–Schwarz inequality / Mathematics / Theoretical computer science / Elementary algebra


The precedence constrained knapsack problem: Separating maximally violated inequalities. Daniel Espinoza Department of Industrial Engineering, Universidad de Chile Marcos Goycoolea School of Business, Universidad Adolfo
Add to Reading List

Document Date: 2012-12-05 08:27:12


Open Document

File Size: 330,59 KB

Share Result on Facebook

IndustryTerm

open pit mining / separation algorithms / pseudo-polynomial time algorithm / approximation algorithms / open pit mining problems / /

Organization

Daniel Espinoza Department of Industrial Engineering / School of Business / Universidad de Chile / Universidad Adolfo Iba˜ nez Eduardo Moreno Faculty of Engineering and Sciences / Universidad Adolfo Iba˜ nez Received / /

Person

Adolfo Iba˜ nez Eduardo / Daniel Espinoza / C. As / Eduardo Moreno / Adolfo Iba˜ nez / /

Position

Traveling Salesman / /

Technology

pseudo-polynomial time algorithm / applying separation algorithms / approximation algorithms / separation algorithms / /

SocialTag