Пакет CoinDip-examples: Информация
Бинарный пакет: CoinDip-examples
Версия: 0.91-alt1.svn20140504
Архитектура: noarch
Собран: 15 мая 2014 г. 8:45 в задании #119796
Исходный пакет: CoinDip
Категория: Development/Documentation
Сообщить об ошибке в пакетеДомашняя страница: http://www.coin-or.org/projects/Dip.xml
Лицензия: Eclipse Public License v1.0
О пакете: Examples for COIN-OR Decomposition for Integer Programming
Описание:
DIP (Decomposition for Integer Programming) is an open-source extensible software framework for implementing decomposition-based bounding algorithms for use in solving large-scale discrete optimization problems. The framework provides a simple API for experimenting with various decomposition-based algorithms, such as Dantzig-Wolfe decomposition, Lagrangian relaxation, and various cutting plane methods. Given a compact formulation and a relaxation, the framework takes care of all algorithmic details associated with implementing any of a wide range of decomposition-based algorithms, such as branch and cut, branch and price, branch and cut and price, subgradient-based Lagrangian relaxation, branch and relax and cut, and decompose and cut. The user can specify customizations, such as methods for generating valid inequalities and branching, in terms of the variables of the compact formulation, without having to worry about the details of any required reformulations. DIP is used in combination with CHiPPS, which provides the underlying tree search methodology. This package contains examples for COIN-OR Decomposition for Integer Programming.
Сопровождающий: Eugeny A. Rostovtsev
Последнее изменение
15 мая 2014 г. Eugeny A. Rostovtsev 0.91-alt1.svn20140504
- Version 0.91
3 декабря 2013 г. Eugeny A. Rostovtsev 0.83.2-alt1.svn20131126
- New snapshot
11 сентября 2013 г. Eugeny A. Rostovtsev 0.83.2-alt1.svn20130906
- New snapshot