GLPK

swMATH4560MaRDI QIDQ16731FDOQ16731

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• New lower bounds for multiple coverings
• Efficient Formal Verification of Bounds of Linear Programs
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• Pyomo -- optimization modeling in Python
• Choosing robust solutions in discrete optimization problems with fuzzy costs
• On the density of 2-colorable 3-graphs in which any four points span at most two edges
• SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
• Maximum frustration in bipartite signed graphs
• Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
• Surface subgroups from linear programming
• Efficient Conversion of Mixed Logical Dynamical Systems Into an Equivalent Piecewise Affine Form
• Density-induced margin support vector machines
• On absolute linear Harbourne constants
• ILP formulation of the degree-constrained minimum spanning hierarchy problem
• A two-phase support method for solving linear programs: numerical experiments
• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
• A Multiparametric Quadratic Programming Algorithm With Polyhedral Computations Based on Nonnegative Least Squares
• A copula-based heuristic for scenario generation
• GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
• On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7)
• Combining linear programming and automated planning to solve intermodal transportation problems
• Title not available (Why is that?)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
• Large neighborhood improvements for solving car sequencing problems
• Flux balance analysis: a geometric perspective
• Efficient Stochastic Programming in Julia
• An integer programming approach to the student-project allocation problem with preferences over projects
• Reinforcement learning for combinatorial optimization: a survey
• On few-class Q-polynomial association schemes: feasible parameters and nonexistence results
• Approximating a linear multiplicative objective in watershed management optimization
• How much do we ``pay for using default parameters?
• An algorithm for addressing the real interval eigenvalue problem
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Real time identification of discrete event systems using Petri nets
• On the one-dimensional stock cutting problem in the paper tube industry
• A scheduling framework for large-scale, parallel, and topology-aware applications
• Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems
• Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
• Advanced analysis of quantum contextuality in a psychophysical double-detection experiment
• Splitting a giant tour using integer linear programming
• Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis
• Title not available (Why is that?)
• Event-driven model predictive control of timed hybrid Petri nets
• Towards railway traffic management using switching max-plus-linear systems, structure analysis and rescheduling
• A pricing mechanism for resource management in grid computing
• A neural-tabu search heuristic for the real time vehicle routing problem
• Title not available (Why is that?)
• \textit{fnyzer}: a Python package for the analysis of flexible nets
• Characterizing and approximating eigenvalue sets of symmetric interval matrices
• A salem number with degree 34 and trace -3
• A Decomposition Algorithm for Feedback Min–Max Model Predictive Control
• Design and implementation of a modular interior-point solver for linear optimization
• Global optimization of generalized semi-infinite programs using disjunctive programming
• Surface fitting and registration of point clouds using approximations of the unsigned distance function
• A FORMAL PROOF OF THE KEPLER CONJECTURE
• Ultra-Fast Stabilizing Model Predictive Control via Canonical Piecewise Affine Approximations
• Title not available (Why is that?)
• A parametric simplex algorithm for linear vector optimization problems
• Planar crack identification in 3D linear elasticity by the reciprocity gap method
• Title not available (Why is that?)
• Optimisation de plans de financement immobiliers
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Optimization problems for the maximum \(k\)-plex
• Computational modeling of Quiescent Platelet Energy Metabolism in the Context of Whole-body Glucose Turnover
• Measuring and Synthesizing Systems in Probabilistic Environments
• Green data centers: using hierarchies for scalable energy efficiency in large web clusters
• Linear Programs for the Kepler Conjecture
• A Method for the Energy Optimization of a Multisource Elevator
• A penalty approach to linear programs with many two-sided constraints
• Toroidal boards and code covering
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
• Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
• Linear programming and algorithms for communication networks. A practical guide to network design, control and management
• An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
• Tight Bounds on Online Checkpointing Algorithms
• Logistic regression: from art to science
• Enabling assisted strategic negotiations in actual-world procurement scenarios
• A model of anytime algorithm performance for bi-objective optimization
• Mathematical modeling of bacterial metabolism
• Title not available (Why is that?)
• Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
• Min-Max MPC based on a network problem
• MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*
• Tax-aware portfolio construction via convex optimization
• Solving large-scale optimization problems related to Bell's theorem
• Inner approximation algorithm for solving linear multiobjective optimization problems
• A note on the inversion join for polyhedral analysis
• On a recognition problem on cut polytope relaxations
• Optimizing winter road maintenance operations under real-time information
• Tactical supply chain planning under uncertainty with an application in the wind turbines industry
• Enumeration of subdifferentials of piecewise linear functions with abs-normal form
• Discrete dynamical system approaches for Boolean polynomial optimization
• Speeding up polyhedral analysis by identifying common constraints
• A comparison of optimization solvers for log binomial regression including conic programming
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• Nearly neighbourly families of standard boxes
• Regular pattern-free coloring
• A graph space optimal transport distance as a generalization of L ^p distances: application to a seismic imaging inverse problem
• Counterexample-Guided Refinement of Template Polyhedra
• Title not available (Why is that?)

This page was built for software: GLPK