Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a...

In this paper, several seller-buyer supply chain models are proposed which incorporate both cost factors as well as elements of competition and cooperation between seller and buyer. We assume that unit marketing expenditure and unit price charged by the buyer influence the demand of the product...

In this paper, we consider a seller–buyer channel in which marketing expenditure is an endogenous decision for the buyer. We assume that both the unit marketing expenditure and the unit price charged by the buyer influence the end demand for the product. We model the seller–buyer...