The following pages link to GLPK (Q16731):
Displaying 37 items.
- On the density of 2-colorable 3-graphs in which any four points span at most two edges (Q3576967) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- (Q4558530) (← links)
- Distributed Solving of Mixed-Integer Programs with GLPK and Thrift (Q4596516) (← links)
- Computational modeling of Quiescent Platelet Energy Metabolism in the Context of Whole-body Glucose Turnover (Q4607538) (← links)
- (Q4636980) (← links)
- Enumeration of subdifferentials of piecewise linear functions with abs-normal form (Q4685602) (← links)
- Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
- A Method for the Energy Optimization of a Multisource Elevator (Q4972879) (← links)
- Tight Bounds on Online Checkpointing Algorithms (Q5002679) (← links)
- Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156) (← links)
- MathOptInterface: A Data Structure for Mathematical Optimization Problems (Q5085984) (← links)
- Efficient Stochastic Programming in Julia (Q5106388) (← links)
- Toroidal boards and code covering (Q5109049) (← links)
- ThIEF: Finding Genome-wide Trajectories of Epigenetics Marks (Q5111825) (← links)
- (Q5139710) (← links)
- MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* (Q5140144) (← links)
- Evaluating and tuning \(n\)-fold integer programming (Q5140719) (← links)
- On few-class Q-polynomial association schemes: feasible parameters and nonexistence results (Q5156012) (← links)
- Efficient Formal Verification of Bounds of Linear Programs (Q5200112) (← links)
- A graph space optimal transport distance as a generalization of <i>L</i> <sup> <i>p</i> </sup> distances: application to a seis (Q5228010) (← links)
- (Q5241193) (← links)
- Algorithm 966 (Q5270778) (← links)
- Efficient Conversion of Mixed Logical Dynamical Systems Into an Equivalent Piecewise Affine Form (Q5273772) (← links)
- A FORMAL PROOF OF THE KEPLER CONJECTURE (Q5280247) (← links)
- A Decomposition Algorithm for Feedback Min–Max Model Predictive Control (Q5281960) (← links)
- Ultra-Fast Stabilizing Model Predictive Control via Canonical Piecewise Affine Approximations (Q5347921) (← links)
- (Q5358292) (← links)
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- (Q5437770) (← links)
- (Q5442489) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- (Q5692633) (← links)
- Linear Programs for the Kepler Conjecture (Q5747875) (← links)
- Modeling and optimizing large-scale production-level transportation systems (Q5878625) (← links)
- Pyomo -- optimization modeling in Python (Q5920040) (← links)
