lp_solve

swMATH4006MaRDI QIDQ16196FDOQ16196

Author name not available (Why is that?)

Cited In (75)

• A general computer program for the Bell detection loophole
• Efficient point coverage in wireless sensor networks
• New Gromov-inspired metrics on phylogenetic tree space
• Active-set prediction for interior point methods using controlled perturbations
• Converting a CAD model into a non-uniform subdivision surface
• Representation of multivariate Bernoulli distributions with a given set of specified moments
• Safe density ratio modeling
• Algorithm runtime prediction: methods \& evaluation
• Deciding probabilistic automata weak bisimulation: theory and practice
• Volume Computation for Boolean Combination of Linear Arithmetic Constraints
• Worst case risk measurement: back to the future?
• A new solver for the minimum weighted vertex cover problem
• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• Matching markers and unlabeled configurations in protein gels
• Generation of structured meshes in multiply connected surfaces using submapping
• A specialized network simplex algorithm for the constrained maximum flow problem
• Buying optimal payoffs in bi-matrix games
• Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
• A comparison of design and model selection methods for supersaturated experiments
• A two-phase support method for solving linear programs: numerical experiments
• The SAT-based approach to separation logic
• Communication protocols for options and results in a distributed optimization environment
• Optimal multi-level supersaturated designs through integer programming
• Applying CEGAR to the Petri net state equation
• Title not available (Why is that?)
• Surface fitting using convex tensor-product splines
• Tracking elementary particles near their primary vertex: A combinatorial approach
• A decentralized two-level transportation problem in a housing material manufacturer: Interactive fuzzy programming approach
• An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
• Fuzzy programming and profit and cost allocation for a production and transportation problem
• Domain specific high-level constraints for user interface layout
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
• Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
• Comparing high-dimensional partitions with the Co-clustering adjusted rand index
• Fluidsim: a car traffic simulation prototype based on fluiddynamic
• The density of sets avoiding distance 1 in Euclidean space
• Sequential importance sampling for multiway tables
• A minimum distance estimator in an imprecise probability model -- computational aspects and applications
• The importance of moral reflection and self-reported data in a dictator game with production
• Asymptotic properties of principal component analysis and shrinkage-bias adjustment under the generalized spiked population model
• A profit-maximizing economic lot scheduling problem with price optimization
• Hybrid schemes for exact conditional inference in discrete exponential families
• Genetic algorithms with double strings for 0-1 programming problems
• Sampling for Conditional Inference on Case–Control Data
• On the identifiability of Bayesian factor analytic models
• Lower bound functions for polynomials
• Certificates of infeasibility via nonsmooth optimization
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• A convex approach to optimum design of experiments with correlated observations
• Writing global optimization software
• Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
• Fulton's conjecture for \(\overline{M}_{0,7}\)
• Automated competitive analysis of real-time scheduling with graph games
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Computational experience with rigorous error bounds for the Netlib linear programming library
• Optimal exact tests for multiple binary endpoints
• Semigroups --- A Computational Approach
• Intercode hexahedral meshing from Eulerian to Lagrangian simulations
• U-splines: splines over unstructured meshes
• Anchored Bayesian Gaussian mixture models
• Directional bivariate quantiles: a robust approach based on the cumulative distribution function
• Assessing uncertainty of voter transitions estimated from aggregated data. Application to the 2017 French presidential election
• Applying CEGAR to the Petri net state equation
• Construction of A-optimal balanced treatment incomplete block designs: An algorithmic approach
• Weighted linear programming discriminant analysis for high‐dimensional binary classification
• Littlewood polynomials, spectral-null codes, and equipowerful partitions
• Typical performance of approximation algorithms for NP-hard problems
• Sampling for Conditional Inference on Case–Control Data
• On a recognition problem on cut polytope relaxations
• Chronos: A timing analyzer for embedded software
• Fractional factorial designs for model-based evaluation of customer preferences
• A boundary element-based automatic domain partitioning approach for semi-structured quad mesh generation
• On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
• Title not available (Why is that?)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver

This page was built for software: lp_solve