Single-vendor multi-buyer inventory coordination under private information (Q933523)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Single-vendor multi-buyer inventory coordination under private information	scientific article

Statements

scholarly article

Single-vendor multi-buyer inventory coordination under private information (English)

European Journal of Operational Research

publication date

21 July 2008

zbMATH Keywords

supply chain management

inventory

private information

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ejor.2007.06.046

Coordination Mechanisms for a Distribution System with One Supplier and Multiple Retailers

A Supplier's Optimal Quantity Discount Policy Under Asymmetric Information

Discrete-Variable Extremum Problems

An algorithm for the solution of the 0-1 knapsack problem

A one-vendor multi-buyer integrated inventory model: A comment

Determination of economic production-shipment policy for a single-vendor--single-buyer system

The single-vendor single-buyer integrated production-inventory model with a generalised policy

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Effects of a demand-curve's shape on the optimal solutions of a multi-echelon inventory/pricing model

Some two-echelon supply-chain games: Improving from deterministic-symmetric-information to stochastic-asymmetric-information models

A stochastic and asymmetric-information framework for a dominant-manufacturer supply chain

A Generalized Quantity Discount Pricing Model to Increase Supplier's Profits

Decentralized Multi-Echelon Supply Chains: Incentives and Information

A one-vendor multi-buyer integrated inventory model

An Efficient Algorithm for the 0-1 Knapsack Problem

A game theoretical analysis of the quantity discount problem with perfect and incomplete information about the buyer's cost structure

98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems

Approximate Algorithms for the 0/1 Knapsack Problem

Deterministic lotsizing models for production planning

Dynamic programming algorithms for the zero-one knapsack problem

Coordinating supply chain inventories through common replenishment epochs

Channel Coordination and Quantity Discounts

Identifiers

zbMATH Open document ID

10.1016/j.ejor.2007.06.046

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:933523

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q933523&oldid=35064271"