Marshall L. Fisher

From MaRDI portal
Person:911483

Available identifiers

zbMath Open fisher.marshall-lMaRDI QIDQ911483

List of research outcomes

PublicationDate of PublicationType
An Econometric Analysis of Inventory Turnover Performance in Retail Services2012-02-21Paper
Supply Chain Inventory Management and the Value of Shared Information2012-02-19Paper
Ending Inventory Valuation in Multiperiod Production Scheduling2012-02-19Paper
Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application2009-08-13Paper
A Periodic Inventory Routing Problem at a Supermarket Chain2009-07-17Paper
Product Variety and Manufacturing Performance: Evidence from the International Automotive Assembly Plant Study1997-12-15Paper
Vehicle Routing with Time Windows: Two Optimization Algorithms1997-11-25Paper
https://portal.mardi4nfdi.de/entity/Q56871921996-12-11Paper
Reducing the Cost of Demand Uncertainty Through Accurate Response to Early Sales1996-10-13Paper
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees1995-06-27Paper
A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing1995-06-21Paper
Coordination of production and distribution planning1994-07-26Paper
A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem1994-01-01Paper
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem1990-01-01Paper
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38151151988-01-01Paper
A Multiplier Adjustment Method for the Generalized Assignment Problem1986-01-01Paper
Analysis of a linearization heuristic for single-machine scheduling to maximize profit1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37222661984-01-01Paper
Surrogate duality relaxation for job shop scheduling1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39411931982-01-01Paper
On the Greedy Heuristic for Continuous Covering and Packing Problems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282871981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282881981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39163611981-01-01Paper
The Lagrangian Relaxation Method for Solving Integer Programming Problems1981-01-01Paper
Probabilistic Analysis of the Planar k-Median Problem1980-01-01Paper
Database Location in Computer Networks1980-01-01Paper
Worst-Case Analysis of Heuristic Algorithms1980-01-01Paper
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”1979-01-01Paper
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit1979-01-01Paper
An analysis of approximations for maximizing submodular set functions—I1978-01-01Paper
An Algorithm for the Space-Shuttle Scheduling Problem1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41801391978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41962691978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38534651977-01-01Paper
A dual algorithm for the one-machine scheduling problem1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41322521977-01-01Paper
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms1977-01-01Paper
The Nonlinear Complementarity Problem: Existence and Determination of Solutions1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41013531976-01-01Paper
Improved integer programming bounds using intersections of corner polyhedra1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41454251975-01-01Paper
A simplicial algorithm for the nonlinear complementarity problem1974-01-01Paper
Constructive Duality in Integer Programming1974-01-01Paper
Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51832541973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marshall L. Fisher