GLPK

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 174 articles )

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

1 2 3 ... 7 8 9 next

  1. Dahmani, Isma; Hifi, Mhand: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (2021)
  2. Jesus, Alexandre D.; Paquete, Luís; Liefooghe, Arnaud: A model of anytime algorithm performance for bi-objective optimization (2021)
  3. Moehle, Nicholas; Kochenderfer, Mykel J.; Boyd, Stephen; Ang, Andrew: Tax-aware portfolio construction via convex optimization (2021)
  4. Chen, Qian Matteo; Finzi, Alberto; Mancini, Toni; Melatti, Igor; Tronci, Enrico: MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks (2020)
  5. Costalonga, João Paulo: Toroidal boards and code covering (2020)
  6. Degue, Kwassi H.; Le Ny, Jerome: Estimation and outbreak detection with interval observers for uncertain discrete-time SEIR epidemic models (2020)
  7. Delanoue, Nicolas; Lhommeau, Mehdi; Lagrange, Sébastien: Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis (2020)
  8. García Soto, Miriam; Prabhakar, Pavithra: Abstraction based verification of stability of polyhedral switched systems (2020)
  9. Héger, Tamás; Szilárd, Péter; Takáts, Marcella: The metric dimension of the incidence graphs of projective planes of small order (2020)
  10. Kloetzer, Marius; Mahulea, Cristian: Path planning for robotic teams based on LTL specifications and Petri net models (2020)
  11. Bojarski, Jacek; Kisielewicz, Andrzej Piotr; Przesławski, Krzysztof: Nearly neighbourly families of standard boxes (2019)
  12. Ferrier, R.; Kadri, M. L.; Gosselet, P.: Planar crack identification in 3D linear elasticity by the reciprocity gap method (2019)
  13. Francesco Farina, Andrea Camisa, Andrea Testa, Ivano Notarnicola, Giuseppe Notarstefano: DISROPT: a Python Framework for Distributed Optimization (2019) arXiv
  14. Kirst, Peter; Stein, Oliver: Global optimization of generalized semi-infinite programs using disjunctive programming (2019)
  15. Métivier, Ludovic; Brossier, R.; Mérigot, Q.; Oudet, E.: A graph space optimal transport distance as a generalization of (L^p) distances: application to a seismic imaging inverse problem (2019)
  16. Pal, Aritra; Charkhgard, Hadi: FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (2019)
  17. Vidali, Janoš: Computing distance-regular graph and association scheme parameters in \textttSageMathwith \textttsage-\textttdrg (2019)
  18. Wenzel, Simon; Misz, Yannik-Noel; Rahimi-Adli, Keivan; Beisheim, Benedikt; Gesthuisen, Ralf; Engell, Sebastian: An optimization model for site-wide scheduling of coupled production plants with an application to the ammonia network of a petrochemical site (2019)
  19. Altmanová, Katerina; Knop, Dusan; Koutecký, Martin: Evaluating and tuning (n)-fold integer programming (2018)
  20. Bar-On, Achiya; Dinur, Itai; Dunkelman, Orr; Hod, Rani; Keller, Nathan; Ronen, Eyal; Shamir, Adi: Tight bounds on online checkpointing algorithms (2018)

1 2 3 ... 7 8 9 next