Similar Search Results

Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization

Carbonneau, Réal; Caporossi, Gilles; Hansen, Pierre - In: Journal of Classification 31 (2014) 2, pp. 219-241

heuristics fail to identify an improving column, an exhaustive search is performed starting with incrementally larger ending …

Persistent link: https://www.econbiz.de/10010950401

Product line pricing for services with capacity constraints and dynamic substitution

Burkart, Wolfgang R.; Klein, Robert; Mayer, Stefan - In: European Journal of Operational Research 219 (2012) 2, pp. 347-359

In this paper, we address a service provider’s product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The...

Persistent link: https://www.econbiz.de/10010577595

Optimal Partitioning of a Data Set Based on the p-Median Model

Brusco, Michael; Köhn, Hans-Friedrich - In: Psychometrika 73 (2008) 1, pp. 89-105

Persistent link: https://www.econbiz.de/10005603501

Heuristics for Multilevel Lot-Sizing with a Bottleneck

Billington, Peter J.; McClain, John O.; Thomas, L. Joseph - In: Management Science 32 (1986) 8, pp. 989-1006

better solutions than some heuristics designed especially for those problems. Test results on the bottleneck problem indicate …

Persistent link: https://www.econbiz.de/10009203846

Column generation based heuristics for a generalized location routing problem with profits arising in space exploration

Ahn, Jaemyung; de Weck, Olivier; Geng, Yue; Klabjan, Diego - In: European Journal of Operational Research 223 (2012) 1, pp. 47-59

The generalized location routing problem with profits is a new routing problem class that combines the vehicle routing problem with profits, depot or base selection, and the notion of strategies and route tactics to be employed at selected bases. The problem simultaneously determines base...

Persistent link: https://www.econbiz.de/10010597668

Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound

Boyer, Vincent; Baz, Didier El; Elkihel, Moussa - In: European Journal of Industrial Engineering 4 (2010) 4, pp. 434-449

combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on … well-known existing heuristics. Then, our exact cooperative method is compared with a classical branch and bound algorithm …

Persistent link: https://www.econbiz.de/10008755658

A column generation method for the multiple-choice multi-dimensional knapsack problem

Cherfi, N.; Hifi, M. - In: Computational Optimization and Applications 46 (2010) 1, pp. 51-73

Persistent link: https://www.econbiz.de/10008552384

Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies

Bertazzi, Luca; Speranza, Maria Grazia; Ukovich, Walter - In: Management Science 46 (2000) 7, pp. 973-988

efficiency of a known branch-and-bound algorithm. Moreover, we present some heuristics and compare them with two different …

Persistent link: https://www.econbiz.de/10009204346

A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems

Hifi, Mhand; Saadi, Toufik - In: Computational Optimization and Applications 51 (2012) 2, pp. 783-807

Persistent link: https://www.econbiz.de/10010539360

Inventory policy characterisation methodologies for a single-product recoverable manufacturing system

Ahiska, Semra Sebnem; King, Russell E. - In: European Journal of Industrial Engineering 9 (2015) 2, pp. 222-243

We consider the production/inventory control for a recoverable system with stochastic demand and returns where stock is replenished by manufacturing new items or remanufacturing returned items. The optimal control policy found by solving a Markov decision process (MDP) for a given problem...

Persistent link: https://www.econbiz.de/10011266508