Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Article Abstract:
Application of branch-and-price algorithms for dual bin packing problem is analyzed. Solutions derived by integer programming are also evaluated.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
A sequential cutting plane algorithm for solving convex NLP problems
Article Abstract:
Solution for convex nonlinear programming optimization problem is derived using Kelley's cutting plane algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Sequential selection procedures: using sample means to improve efficiency
Article Abstract:
Enhanced sequential ranking and selection procedure to examine alternative system designs is proposed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Approximation algorithms for the oriented two-dimensional bin packing problem. A note on exact algorithms for the identical parallel machine scheduling problem
- Abstracts: A branch-and-bound algorithm for the mini-max spanning forest problem. An improved algorithm to determine lower bounds for fixed spectrum frequency assignment problem
- Abstracts: An intelligent system for US Coast Guard cutter scheduling. Modelling and analysis of multistage stochastic programming problems: a software environment
- Abstracts: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. part 2 An introduction to multi-parameter complexity analysis of discrete problems
- Abstracts: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. A heuristic to schedule flexible job-shop in a glass factory