Modelling and Solving an M-Location, N-Courier, Priority-Based Planning Problem on a Network

Journal of the Operational Research Society - United Kingdom
doi 10.1057/jors.2011.8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2014English

An Acceptability Index Based Approach for Solving Shortest Path Problem on a Network With Interval Weights

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2020English

A Problem Solving Environment Based on CORBA

Scientific Programming
Computer Science ApplicationsSoftware
2001English

An Improved DCA and Channel Modelling Algorithm Based on Carrier Priority in LTE/LTE-A

American Journal of Networks and Communications
2013English

Solving the Median Problem With Continuous Demand on a Network

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2013English

A Model for Solving the Prescribed Burn Planning Problem

SpringerPlus
Multidisciplinary
2015English

An Assignment Problem on a Network

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1976English

A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Chemistry Problem Solving Instruction: A Comparison of Three Computer-Based Formats for Learning From Hierarchical Network Problem Representations

Instructional Science
DevelopmentalEducationEducational Psychology
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy