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
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• Pyomo -- optimization modeling in Python
• Shape optimization under uncertainty from a stochastic programming point of view.
• 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
• Benders decomposition approach to robust mixed integer programming
• 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
• Efficient formal verification of bounds of linear programs
• GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
• 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\)
• On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
• 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
• 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
• \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
• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
• Faster MIP solutions via new node selection rules
• Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• An improved algorithm for solving biobjective integer programs
• Hybrid model predictive control of a solar air conditioning plant
• A framework for certified Boolean branch-and-bound optimization
• Combined task- and network-level scheduling for distributed time-triggered systems
• Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem
• Fire containment in grids of dimension three and higher
• Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
• MIPLIB 2003
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• BEM solution of delamination problems using an interface damage and plasticity model
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Using the analytic center in the feasibility pump
• Mathematical programming: Turing completeness and applications to software analysis
• Disconnecting graphs by removing vertices: a polyhedral approach
• A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
• A set-covering approach with column generation for parsimony haplotyping
• LPFML: A W3C XML schema for linear and integer programming
• Finding all solutions of separable systems of piecewise-linear equations using integer programming
• Bounds on 4D conformal and superconformal field theories
• Detecting squarefree numbers
• Deciding probabilistic automata weak bisimulation: theory and practice
• On the application of an augmented Lagrangian algorithm to some portfolio problems
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Communication protocols for options and results in a distributed optimization environment
• A mathematical model and a metaheuristic approach for a memory allocation problem
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• Redundant robust topology optimization of truss
• Scaling linear optimization problems prior to application of the simplex method
• Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
• Achieving MILP feasibility quickly using general disjunctions
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Title not available (Why is that?)
• On the existence of a minimum integer representation for weighted voting systems
• 1-norm support vector novelty detection and its sparseness
• A new Lagrangean approach to the pooling problem
• Title not available (Why is that?)
• The linear programming bound for codes over finite Frobenius rings
• Algorithm 928

This page was built for software: GLPK