The following pages link to GLPK (Q16731):
Displaying 50 items.
- Combining linear programming and automated planning to solve intermodal transportation problems (Q2253643) (← links)
- A salem number with degree 34 and trace -3 (Q2253871) (← links)
- On a recognition problem on cut polytope relaxations (Q2261801) (← links)
- Detecting squarefree numbers (Q2263800) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- Nearly neighbourly families of standard boxes (Q2278122) (← links)
- An optimization model for site-wide scheduling of coupled production plants with an application to the ammonia network of a petrochemical site (Q2302358) (← links)
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg} (Q2306451) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Surface subgroups from linear programming (Q2345112) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- A copula-based heuristic for scenario generation (Q2355193) (← links)
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (Q2355899) (← links)
- Redundant robust topology optimization of truss (Q2357836) (← links)
- Optimizing winter road maintenance operations under real-time information (Q2378483) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- The linear programming bound for codes over finite Frobenius rings (Q2384000) (← links)
- New lower bounds for multiple coverings (Q2384059) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Real time identification of discrete event systems using Petri nets (Q2440714) (← links)
- A linear programming approach to the Manickam-Miklós-Singhi conjecture (Q2441613) (← links)
- Green data centers: using hierarchies for scalable energy efficiency in large web clusters (Q2444759) (← links)
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
- Fire containment in grids of dimension three and higher (Q2457006) (← links)
- Enabling assisted strategic negotiations in actual-world procurement scenarios (Q2466387) (← links)
- MIPLIB 2003 (Q2466583) (← links)
- Min-Max MPC based on a network problem (Q2474457) (← links)
- Splitting a giant tour using integer linear programming (Q2631278) (← links)
- A comparison of optimization solvers for log binomial regression including conic programming (Q2666995) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- A note on the inversion join for polyhedral analysis (Q2814111) (← links)
- Speeding up polyhedral analysis by identifying common constraints (Q2814112) (← links)
- LPFML: A W3C XML schema for linear and integer programming (Q2890463) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- A set-covering approach with column generation for parsimony haplotyping (Q2901055) (← links)
- Linear programming and algorithms for communication networks. A practical guide to network design, control and management (Q2915363) (← links)
- Event-driven model predictive control of timed hybrid Petri nets (Q2925108) (← links)
- A Multiparametric Quadratic Programming Algorithm With Polyhedral Computations Based on Nonnegative Least Squares (Q2982506) (← links)
- Optimisation de plans de financement immobiliers (Q3057530) (← links)
- Forest Analytics with R (Q3060351) (← links)
- A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586) (← links)
- Algorithm 928 (Q3189680) (← links)
- Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
- Estimation and outbreak detection with interval observers for uncertain discrete-time SEIR epidemic models (Q3386567) (← links)
- Polymorphic Fractional Capabilities (Q3392918) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (Q3502696) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- (Q3562827) (← links)
