The following pages link to Marshall L. Fisher (Q911483):
Displaying 48 items.
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- (Q1171503) (redirect page) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Coordination of production and distribution planning (Q1328573) (← links)
- A Multiplier Adjustment Method for the Generalized Assignment Problem (Q3030567) (← links)
- Supply Chain Inventory Management and the Value of Shared Information (Q3114637) (← links)
- Ending Inventory Valuation in Multiperiod Production Scheduling (Q3114696) (← links)
- An Econometric Analysis of Inventory Turnover Performance in Retail Services (Q3115444) (← links)
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596) (← links)
- (Q3328287) (← links)
- (Q3328288) (← links)
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application (Q3392131) (← links)
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (Q3487135) (← links)
- (Q3722266) (← links)
- (Q3815115) (← links)
- (Q3853465) (← links)
- Probabilistic Analysis of the Planar <i>k</i>-Median Problem (Q3875687) (← links)
- Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” (Q3879020) (← links)
- Database Location in Computer Networks (Q3890141) (← links)
- Worst-Case Analysis of Heuristic Algorithms (Q3895229) (← links)
- (Q3916361) (← links)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems (Q3919449) (← links)
- (Q3941193) (← links)
- A simplicial algorithm for the nonlinear complementarity problem (Q4042852) (← links)
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I (Q4047423) (← links)
- Constructive Duality in Integer Programming (Q4054817) (← links)
- Improved integer programming bounds using intersections of corner polyhedra (Q4074667) (← links)
- (Q4101353) (← links)
- A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
- (Q4132252) (← links)
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210) (← links)
- The Nonlinear Complementarity Problem: Existence and Determination of Solutions (Q4135240) (← links)
- (Q4145425) (← links)
- An analysis of approximations for maximizing submodular set functions—I (Q4152030) (← links)
- An Algorithm for the Space-Shuttle Scheduling Problem (Q4156116) (← links)
- (Q4180139) (← links)
- (Q4196269) (← links)
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (Q4199854) (← links)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees (Q4319751) (← links)
- A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem (Q4319765) (← links)
- Product Variety and Manufacturing Performance: Evidence from the International Automotive Assembly Plant Study (Q4363572) (← links)
- Vehicle Routing with Time Windows: Two Optimization Algorithms (Q4367240) (← links)
- On the Greedy Heuristic for Continuous Covering and Packing Problems (Q4750653) (← links)
- A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing (Q4836841) (← links)
- Reducing the Cost of Demand Uncertainty Through Accurate Response to Early Sales (Q4883205) (← links)
- (Q5183254) (← links)
- A Periodic Inventory Routing Problem at a Supermarket Chain (Q5321999) (← links)
- (Q5687192) (← links)
