Cambridge, MA 02142
Massachusetts Institute of Technology (MIT) - Sloan School of Management
in Total Papers Downloads
in Total Papers Citations
Weapon Target Assignment, WTA, very large-scale neighborhood search algorithm
Node, Minimum Cost Walk Problem, Polynomially, FIFO Networks, NP-hard Problem
Local Search, Neighborhood Search, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, 0/1-Integer Programming
sensitivity analysis, shortest path problem, bottleneck shortest path, maximum capacity path problem
Locomotive, Mixed Interger Programming, MIP
Location Problems, Large Scale Optimization, Multi-exchange
dynamic programming, neighborhood construction techniques,
Fleet Assignment Model, FAM, TAM, Very Large-Scale Neighborhood, VLSN
Lexicography, Noncompensatory decision rules, Choice heuristics, Optimization methods in marketing, Conjoint analysis, Product development, Consideration sets.
Large Scale Neighborhoods, Routing, VLSN, CIM
Inventory Replenishment Policy
Quadratic Assignment Problem, QAP, Very Large-Scale Neighborhood, VLSN
transportation, air, heuristics, integer programming, neighborhood search, networks
Algorithms, Experimentation, Theory, Approximation Algorithms, Average Case Analysis, Bin Packing
Cookies are used by this site. To decline or learn more, visit our Cookies page.
This page was processed by apollobot1 in 0.782 seconds
We'd like to ask you to provide feedback on your experience with SSRN today. Your feedback will be used to enhance the site in the future.
Would you be willing to answer a few questions when you leave our site?
Yes, I'm willing to take part in a survey
No, thank you