Linear Programming
From MaRDI portal
Recommendations
Cited in
(60)- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Note on implementing the new sphere method for LP using matrix inversions sparingly
- Fuzzy capital rationing model
- An overview on the simplex algorithm
- Measuring inconsistency
- A nontangential cutting plane algorithm
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- A multiobjective optimization algorithm based on discrete bacterial colony chemotaxis
- Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
- A linear framework for region-based image segmentation and inpainting involving curvature penalization
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Non-Archimedean zero-sum games
- The big-M method with the numerical infinite M
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Block aggregation of stress constraints in topology optimization of structures
- Polynomial convolutions in max-plus algebra
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Alternating direction method of multipliers for linear programming
- Construction of the largest sensitivity region for general linear programs
- On approximation of the heat capacity of substances in the gaseous state
- Computing the Monge-Kantorovich distance
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Interval judgments and Euclidean centers
- George B. Dantzig: a legendary life in mathematical programming
- Reinforcement learning for combinatorial optimization: a survey
- On the structure of optimal transportation plans between discrete measures
- A self-adaptive combined strategies algorithm for constrained optimization using differential evolution
- A survey of satisfiability modulo theory
- New search strategies for the Petri net CEGAR approach
- Algebraic simplex initialization combined with the nonfeasible basis method
- scientific article; zbMATH DE number 3874952 (Why is no real title available?)
- Interactive materials for the resolution of a linear programming problem using the simplex method
- \((k,j)\)-coloring of sparse graphs
- Augmented Markov chain Monte Carlo simulation for two-stage stochastic programs with recourse
- scientific article; zbMATH DE number 954269 (Why is no real title available?)
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Exponential estimate of positive time-delay systems with polytopic uncertainties
- Flexible objective Bayesian linear regression with applications in survival analysis
- Bayesian quantile regression for ordinal models
- scientific article; zbMATH DE number 270745 (Why is no real title available?)
- Weighted covering numbers of convex sets
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Bayesian quantile regression for longitudinal count data
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- A synthesis algorithm for an oil spill problem of complementary locations on networks
- Tropical medians by transportation
- Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
- Characterization of generic parameter families of constraint mappings in optimization
- Minimal flow morsification subject to level set control: a combinatorial approach
- A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
- Minimum cost super-hedging in a discrete time incomplete multi-asset binomial market
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- Nonparametric testing of first-order structure in point processes on linear networks
- Minimal solutions to the Skorokhod reflection problem driven by càdlàg processes and an application to reinsurance
- Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
- An extended alternating direction method for variational inequality problems with linear equality and inequality constraints
- Necessary and sufficient conditions for reachability on a simplex
- Euclidean centers: Computation, properties and a MOLP application
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- Improvements in the treatment of stress constraints in structural topology optimization problems
This page was built for publication: Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344060)
