GNU Linear Programming Kit

435 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A FORMAL PROOF OF THE KEPLER CONJECTURE (2015, unknown): “We use GLPK for solving linear programs [ 8 ] and a special C# program for ﬁnding the required modiﬁed dual solutions for linear programs.”
Virtual Network Embedding with Coordinated Node and Link Mapping (2009, methodology): “We have used the open source mixed integer programming library glpk [19] to solve VNE LP RELAX .”
Footstep planning on uneven terrain with mixed-integer convex optimization (2014, unknown): “6.”
A semidefinite program solver for the conformal bootstrap (2015, methodology): “For example in [5], a custom-written linear program solver enabled a new high-precision calculation of critical exponents in the 3d Ising CFT, surpassing what was possible with out-of-the-box solvers like Mathematica [41] (used in the original work [1]), GLPK [42], and CPLEX [43].”
Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks (2016, methodology): “Optimization solvers, like Gurobi [16] or GLPK [15], are explicitly designed to solve constrained optimization problems and can be used to tackle optimized scheduling (cf. [8] for an example).”