The GLPK (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. GLPK supports the GNU MathProg modeling language, which is a subset of the AMPL language. The GLPK package includes the following main components: primal and dual simplex methods, primal-dual interior-point method, branch-and-cut method, translator for GNU MathProg, application program interface (API), stand-alone LP/MIP solver

References in zbMATH (referenced in 99 articles )

Showing results 1 to 20 of 99.
Sorted by year (citations)

1 2 3 4 5 next

  1. Birgin, E.G.; Martínez, J.M.: On the application of an augmented Lagrangian algorithm to some portfolio problems (2016)
  2. Craciunas, Silviu S.; Oliver, Ramon Serna: Combined task- and network-level scheduling for distributed time-triggered systems (2016)
  3. Delanoue, Nicolas; Lhommeau, Mehdi; Lucidarme, Philippe: Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem (2016)
  4. Ferrer Fioriti, Luis María; Hashemi, Vahid; Hermanns, Holger; Turrini, Andrea: Deciding probabilistic automata weak bisimulation: theory and practice (2016)
  5. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  6. Johnston, Matthew D.; Pantea, Casian; Donnell, Pete: A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems (2016)
  7. Bouzid, Mouaouia Cherif: Splitting a giant tour using integer linear programming (2015)
  8. El Otmani, S.; Rhin, G.; Sac-Épée, J.-M.: A salem number with degree 34 and trace -3 (2015)
  9. Kirst, Peter; Stein, Oliver; Steuermann, Paul: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (2015)
  10. Kubica, Bartłomiej Jacek: Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems (2015)
  11. Kuno, Takahito; Ishihama, Tomohiro: A convergent conical algorithm with $\omega $-bisection for concave minimization (2015)
  12. Lipták, György; Szederkényi, Gábor; Hangos, Katalin M.: Computing zero deficiency realizations of kinetic systems (2015)
  13. Giro, Sergio: Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (2014)
  14. Gondzio, Jacek; Gruca, Jacek A.; Hall, J.A.Julian; Laskowski, Wiesław; Żukowski, Marek: Solving large-scale optimization problems related to Bell’s theorem (2014)
  15. Hartke, Stephen G.; Stolee, Derrick: A linear programming approach to the Manickam-Miklós-Singhi conjecture (2014)
  16. Kaut, Michal: A copula-based heuristic for scenario generation (2014)
  17. Kloetzer, Marius; Mahulea, Cristian: A Petri net based approach for multi-robot path planning (2014)
  18. Liberti, Leo; Marinelli, Fabrizio: Mathematical programming: Turing completeness and applications to software analysis (2014)
  19. Rudan, János; Szederkényi, Gábor; Hangos, Katalin M.; Péni, Tamás: Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (2014)
  20. Chai, Song; Li, Yubai; Wang, Jian; Wu, Chang: A genetic algorithm for task scheduling on NoC using FDH cross efficiency (2013)

1 2 3 4 5 next