{"bugs":[{"bugid":731856,"firstseen":"2020-07-09T14:03:58.226547","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-symphony-5.5.7 fails to compile: ordered comparison between pointer and zero ('int *' and 'int')"},{"bugid":831686,"firstseen":"2022-01-21T08:48:11.130639","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-symphony-5.6.17 fails to compile: ld.lld: error: cannot find linker script P"},{"bugid":928029,"firstseen":"2024-03-28T08:58:28.295855","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-symphony-5.6.17 has implicit function declarations in configure logs"},{"bugid":942064,"firstseen":"2024-10-24T10:58:35.535600","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-symphony-5.6.17 fails to compile: sym_lp_solver.h:118:2: error: error Undefined or unknown LP solver"}],"categories":[{"categoryid":318,"name":"sci-libs","summary":"The sci-libs category contains various science-related libraries."},{"categoryid":317,"name":"sci-mathematics","summary":"The sci-mathematics category contains mathematical software."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"a6fd2dbcf2ebd0f3ec4ad8800eb96b0e94d1e7af","committime":"2021-02-28T15:52:03","packageid":61827,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"sudinave@gmail.com","authorname":"Ionen Wolkens","body":"Closes: https:\/\/github.com\/gentoo\/gentoo\/pull\/19701\nPackage-Manager: Portage-3.0.15, Repoman-3.0.2\nSigned-off-by: Ionen Wolkens \nSigned-off-by: David Seifert ","commitid":"22e4f4783cab7218a07580ccc95618a916920d93","committime":"2021-02-28T15:44:01","packageid":61827,"repoid":1,"summary":"sci-libs\/coinor-symphony: add missing optional test dep + style fixes"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"e4e753c82412dd6293b9edb8a57235b9cb72918f","committime":"2021-02-27T03:32:59","packageid":61827,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"sudinave@gmail.com","authorname":"Ionen Wolkens","body":"Package-Manager: Portage-3.0.15, Repoman-3.0.2\nSigned-off-by: Ionen Wolkens \nSigned-off-by: Sam James ","commitid":"b4575298f030368bb164a28fbc1e8919613e7335","committime":"2021-02-26T12:20:34","packageid":61827,"repoid":1,"summary":"sci-libs\/coinor-symphony: remove old"},{"authoremail":"sudinave@gmail.com","authorname":"Ionen Wolkens","body":"Has reworked old workarounds and added doc deps.\n\nUSE=examples removed, now installed unconditionally (small files).\nUSE=doc now generates the pdf manual.\nUSE=static-libs removed.\n\nFixed directory change for USE=doc (bug #608114).\n\nCloses: https:\/\/bugs.gentoo.org\/608114\nPackage-Manager: Portage-3.0.15, Repoman-3.0.2\nSigned-off-by: Ionen Wolkens \nSigned-off-by: Sam James ","commitid":"f1a3595a143380ff2ef6f9c54f4b5f4a161b138d","committime":"2021-02-26T12:20:17","packageid":61827,"repoid":1,"summary":"sci-libs\/coinor-symphony: bump to 5.6.17, ported to EAPI 7"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"fef742528aacdd4ffa4e59ea0354106ca161650e","committime":"2019-12-10T23:48:11","packageid":61827,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mgorny@gentoo.org","authorname":"Michał Górny","body":"The result was achieved via the following pipeline:\n\n pkgcheck scan -c RestrictTestCheck -R FormatReporter \\\n --format '{category}\/{package}\/{package}-{version}.ebuild' |\n xargs -n32 grep -L RESTRICT |\n xargs -n32 sed -i -e '\/^IUSE=.*test\/aRESTRICT=\"!test? ( test )\"'\n\nThe resulting metadata was compared before and after the change.\nFew Go ebuilds had to be fixed manually due to implicit RESTRICT=strip\nadded by the eclass. Two ebuilds have to be fixed because of multiline\nIUSE.\n\nSuggested-by: Robin H. Johnson \nCloses: https:\/\/github.com\/gentoo\/gentoo\/pull\/13942\nSigned-off-by: Michał Górny ","commitid":"064af661d0c9a31cecdf348632bc5603333a9149","committime":"2019-12-10T22:02:54","packageid":61827,"repoid":1,"summary":"*\/*: [QA] Fix trivial cases of MissingTestRestrict"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"25093d6359f778b8d1052f66ba9e26fc29ded21a","committime":"2017-02-28T20:35:29","packageid":61827,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"Signed-off-by: Robin H. Johnson ","commitid":"61b861acd7b49083dab687e133f30f3331cb7480","committime":"2017-02-28T19:47:27","packageid":61827,"repoid":1,"summary":"Drop $Id$ per council decision in bug #611234."},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"945f0d2a26da4f944fd06ad6a874f69d37ce1e06","committime":"2015-08-09T09:26:46","packageid":61827,"repoid":1,"summary":"2015-08-09 09:26:21 UTC"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"This commit represents a new era for Gentoo:\nStoring the gentoo-x86 tree in Git, as converted from CVS.\n\nThis commit is the start of the NEW history.\nAny historical data is intended to be grafted onto this point.\n\nCreation process:\n1. Take final CVS checkout snapshot\n2. Remove ALL ChangeLog* files\n3. Transform all Manifests to thin\n4. Remove empty Manifests\n5. Convert all stale $Header$\/$Id$ CVS keywords to non-expanded Git $Id$\n5.1. Do not touch files with -kb\/-ko keyword flags.\n\nSigned-off-by: Robin H. Johnson \nX-Thanks: Alec Warner - did the GSoC 2006 migration tests\nX-Thanks: Robin H. Johnson - infra guy, herding this project\nX-Thanks: Nguyen Thai Ngoc Duy - Former Gentoo developer, wrote Git features for the migration\nX-Thanks: Brian Harring - wrote much python to improve cvs2svn\nX-Thanks: Rich Freeman - validation scripts\nX-Thanks: Patrick Lauer - Gentoo dev, running new 2014 work in migration\nX-Thanks: Michał Górny - scripts, QA, nagging\nX-Thanks: All of other Gentoo developers - many ideas and lots of paint on the bikeshed","commitid":"56bd759df1d0c750a065b8c845e93d5dfa6b549d","committime":"2015-08-08T20:49:04","packageid":61827,"repoid":1,"summary":"proj\/gentoo: Initial commit"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"a637bd65b7fef8e2be4e7fc6e9097479372e0e2e","committime":"2015-06-19T16:38:33","packageid":61827,"repoid":1,"summary":"2015-06-19 16:35:30 UTC"}],"dependencies":[{"block":false,"categoryid":317,"description":"GNU Linear Programming Kit","ebuildids":[704538],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"robbat2@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"glpk","packageid":44310,"summary":"The GNU Linear Programming Kit package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library."},{"block":false,"categoryid":318,"description":"COIN-OR cut-generation library","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cgl","packageid":61816,"summary":"The COIN-OR Cut Generation Library (Cgl) is an open collection of cutting plane implementations (\"cut generators\") for use in teaching, research, and applications. Cgl can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming."},{"block":false,"categoryid":318,"description":"COIN-OR linear programming solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-clp","packageid":61817,"summary":"Clp (Coin-OR linear programming) is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. It is designed to find solutions of constrained linear mathematical optimization problems."},{"block":false,"categoryid":318,"description":"COIN-OR dynamic simplex linear program solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dylp","packageid":61820,"summary":"DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-osi","packageid":61824,"summary":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver."},{"block":false,"categoryid":318,"description":"COIN-OR Matrix, Vector and other utility classes","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-utils","packageid":61828,"summary":"CoinUtils (Coin-or Utilities) is a collection of classes that are generally useful to COmputational INfrastructure for Operations Research (COIN-OR) projects. These include vector, matrix, mps file reading classes."},{"block":false,"categoryid":318,"description":"COIN-OR volume algorithm linear program solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-vol","packageid":61829,"summary":"Volume Algorithm is part of COIN-OR (COmputational INfrastructure for Operations Research) project. Vol is an implementation of a subgradient method that produces primal as well as dual solutions."}],"depending":[{"block":false,"categoryid":318,"description":"COIN-OR Decomposition in Integer Programming library","ebuildids":[713406,713406],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dip","packageid":61819,"summary":"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."}],"ebuilds":[{"archs":["~amd64","~amd64-linux","~x86","~x86-linux"],"ebuildid":704538,"firstseen":"2021-02-27T03:53:47.693271","license":"EPL-1.0","moddate":"2021-02-28T15:53:28","packageid":61827,"repoid":1,"slot":"0\/3","uses":["doc","glpk","test"],"version":"5.6.17"}],"masks":[],"package":{"categoryid":318,"description":"COIN-OR solver for mixed-integer linear programs","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-symphony","packageid":61827,"summary":"SYMPHONY is a generic mixed-integer linear programs (MILP) solver, callable library, and extensible framework for implementing customized solvers. SYMPHONY has a number of advanced capabilities, including the ability to solve multi-objective MILPs, the ability to warm start its solution procedure. SYMPHONY is part of the larger COIN-OR initiative (Computational Infrastructurefor Operations Research)."},"rdependencies":[{"block":false,"categoryid":317,"description":"GNU Linear Programming Kit","ebuildids":[704538],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"robbat2@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"glpk","packageid":44310,"summary":"The GNU Linear Programming Kit package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library."},{"block":false,"categoryid":318,"description":"COIN-OR cut-generation library","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cgl","packageid":61816,"summary":"The COIN-OR Cut Generation Library (Cgl) is an open collection of cutting plane implementations (\"cut generators\") for use in teaching, research, and applications. Cgl can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming."},{"block":false,"categoryid":318,"description":"COIN-OR linear programming solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-clp","packageid":61817,"summary":"Clp (Coin-OR linear programming) is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. It is designed to find solutions of constrained linear mathematical optimization problems."},{"block":false,"categoryid":318,"description":"COIN-OR dynamic simplex linear program solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dylp","packageid":61820,"summary":"DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-osi","packageid":61824,"summary":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver."},{"block":false,"categoryid":318,"description":"COIN-OR Matrix, Vector and other utility classes","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-utils","packageid":61828,"summary":"CoinUtils (Coin-or Utilities) is a collection of classes that are generally useful to COmputational INfrastructure for Operations Research (COIN-OR) projects. These include vector, matrix, mps file reading classes."},{"block":false,"categoryid":318,"description":"COIN-OR volume algorithm linear program solver","ebuildids":[704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-vol","packageid":61829,"summary":"Volume Algorithm is part of COIN-OR (COmputational INfrastructure for Operations Research) project. Vol is an implementation of a subgradient method that produces primal as well as dual solutions."}],"repos":[{"branch":"master","lastcommit":"450460fefe0916c237e2fd93afd039afae67bafe","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/projects.coin-or.org\/SYMPHONY\/"],"uses":[{"description":"Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally","isdefault":false,"use":"doc"},{"description":"Enable GNU Linear Programming Kit sci-mathematics\/glpk support","isdefault":false,"packageid":61827,"use":"glpk"},{"description":"Enable dependencies and\/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)","isdefault":false,"use":"test"}]}