GLPK
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On the existence of a minimum integer representation for weighted voting systems
- A new Lagrangean approach to the pooling problem
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- CsegGraph
- LPAKO
- fnyzer
- Gravity
- InfiniteOpt
- POLO.jl
- StochasticPrograms.jl
- Sparrow Scheduler
- LDLFactorizations.jl
- UnitBlockAngular.jl
- LPBenchmarks
- Tulip.jl
- Sdpsol
- MaxSolver
- BarcelogicTools
- lp_solve
- Flux balance analysis: a geometric perspective
- Zimpl
- CPLEX
- lpSolve
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Cbc
- An integer programming approach to the student-project allocation problem with preferences over projects
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- COIN-OR
- Advanced analysis of quantum contextuality in a psychophysical double-detection experiment
- TSP software
- Compact extended linear programming models
- Customizing the solution process of COIN-OR's linear solvers with python
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- XPRESS
- APLEpy
- FlopC++
- OpenOpt
- OptimJ
- PuLP
- PyGlpk
- LINGO
- MIQP
- MIPTS
- CLP
- PyCOIN
- HYSDEL
- On absolute linear Harbourne constants
- Logistic regression: from art to science
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables
- Mathematical modeling of bacterial metabolism
- Tactical supply chain planning under uncertainty with an application in the wind turbines industry
- mkc7
- LPFML
- On K-diagnosability of Petri nets via integer linear programming
- PLplot
- Maximum frustration in bipartite signed graphs
- Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
- A two-phase support method for solving linear programs: numerical experiments
- FortSP
- OSiL
- Planar crack identification in 3D linear elasticity by the reciprocity gap method
- scallop
- wallop
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- A convergent conical algorithm with -bisection for concave minimization
- A model of anytime algorithm performance for bi-objective optimization
- Tax-aware portfolio construction via convex optimization
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing
- G-Hadoop
- Design and implementation of a modular interior-point solver for linear optimization
- FortMP
- Optimization-based assessment of initial-state opacity in Petri nets
- Intercode hexahedral meshing from Eulerian to Lagrangian simulations
- Hypertool
- MCDMlib
- Approximating a linear multiplicative objective in watershed management optimization
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- Optimization problems for the maximum k-plex
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- \textit{fnyzer}: a Python package for the analysis of flexible nets
- A penalty approach to linear programs with many two-sided constraints
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- NLTOOLBOX
- UMDES
- Discrete dynamical system approaches for Boolean polynomial optimization
- Regular pattern-free coloring
- Path planning for robotic teams based on LTL specifications and Petri net models
- Abstraction based verification of stability of polyhedral switched systems
- RELAX4
- Solving large-scale optimization problems related to Bell's theorem
- Combining linear programming and automated planning to solve intermodal transportation problems
- A salem number with degree 34 and trace -3
- On a recognition problem on cut polytope relaxations
- Detecting squarefree numbers
- Faster MIP solutions via new node selection rules
- Nearly neighbourly families of standard boxes
This page was built for software: GLPK
