Cited in
(only showing first 100 items - show all)- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Enumeration of subdifferentials of piecewise linear functions with ABS-normal form
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Faster MIP solutions via new node selection rules
- Planar crack identification in 3D linear elasticity by the reciprocity gap method
- New lower bounds for multiple coverings
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- Hybrid model predictive control of a solar air conditioning plant
- An improved algorithm for solving biobjective integer programs
- Combined task- and network-level scheduling for distributed time-triggered systems
- Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- Optimization problems for the maximum \(k\)-plex
- A framework for certified Boolean branch-and-bound optimization
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- 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
- BEM solution of delamination problems using an interface damage and plasticity model
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Using the analytic center in the feasibility pump
- Mathematical programming: Turing completeness and applications to software analysis
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Shape optimization under uncertainty from a stochastic programming point of view.
- Pyomo -- optimization modeling in Python
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Donut domains: efficient non-convex domains for abstract interpretation
- Disconnecting graphs by removing vertices: a polyhedral approach
- On the density of 2-colorable 3-graphs in which any four points span at most two edges
- A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
- Green data centers: using hierarchies for scalable energy efficiency in large web clusters
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- A set-covering approach with column generation for parsimony haplotyping
- LPFML: A W3C XML schema for linear and integer programming
- Benders decomposition approach to robust mixed integer programming
- Bounds on 4D conformal and superconformal field theories
- A penalty approach to linear programs with many two-sided constraints
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
- Maximum frustration in bipartite signed graphs
- Linear Programs for the Kepler Conjecture
- Toroidal boards and code covering
- Deciding probabilistic automata weak bisimulation: theory and practice
- On the application of an augmented Lagrangian algorithm to some portfolio problems
- Detecting squarefree numbers
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- Surface subgroups from linear programming
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- Linear programming and algorithms for communication networks. A practical guide to network design, control and management
- Density-induced margin support vector machines
- On absolute linear Harbourne constants
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Efficient Conversion of Mixed Logical Dynamical Systems Into an Equivalent Piecewise Affine Form
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Logistic regression: from art to science
- A two-phase support method for solving linear programs: numerical experiments
- Communication protocols for options and results in a distributed optimization environment
- A mathematical model and a metaheuristic approach for a memory allocation problem
- A formal proof of the Kepler conjecture
- Sparse concordance-assisted learning for optimal treatment decision
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- Enabling assisted strategic negotiations in actual-world procurement scenarios
- A model of anytime algorithm performance for bi-objective optimization
- Redundant robust topology optimization of truss
- Mathematical modeling of bacterial metabolism
- Multiscale strategies for computing optimal transport
- 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
- Parallel machine scheduling by family batching with sequence-independent set-up times
- Min-Max MPC based on a network problem
- Tax-aware portfolio construction via convex optimization
- Efficient formal verification of bounds of linear programs
- Scaling linear optimization problems prior to application of the simplex method
- Combining linear programming and automated planning to solve intermodal transportation problems
- Solving large-scale optimization problems related to Bell's theorem
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
- Achieving MILP feasibility quickly using general disjunctions
- Inner approximation algorithm for solving linear multiobjective optimization problems
- Measuring and synthesizing systems in probabilistic environments
- scientific article; zbMATH DE number 7656030 (Why is no real title available?)
- A note on the inversion join for polyhedral analysis
- On a recognition problem on cut polytope relaxations
- Distributed solving of mixed-integer programs with GLPK and Thrift
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- 1-norm support vector novelty detection and its sparseness
- On the existence of a minimum integer representation for weighted voting systems
- Large neighborhood improvements for solving car sequencing problems
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- CsegGraph
- LPAKO
- Sdpsol
- BarcelogicTools
- MaxSolver
- lp_solve
- CPLEX
- lpSolve
- Zimpl
This page was built for software: GLPK
