Heuristics for a One-Warehouse Multiretailer Distribution Problem With Performance Bounds

Operations Research - United States
doi 10.1287/opre.45.1.102
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Heuristics for a Matrix Symmetrization Problem

English

A Heuristics Algorithm for Centralized Deicing Scheduling Problem

2019English

A Distribution Network Design Problem in the Automotive Industry: MIP Formulation and Heuristics

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2014English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

Heuristics for a Vehicle Routing Problem With Information Collection in Wireless Networks

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2019English

New Heuristics for the Maximum Diversity Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2007English

Variable Neighborhood Search Heuristics for a Test Assembly Design Problem

Expert Systems with Applications
EngineeringComputer Science ApplicationsArtificial Intelligence
2015English

Tight Bounds for the Subspace Sketch Problem With Applications

2020English

Heuristics for No-Wait Flow Shop Scheduling Problem

International Journal of Industrial Engineering Computations
IndustrialManufacturing Engineering
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy