scientific article; zbMATH DE number 193993
From MaRDI portal
Publication:4040780
ellipsoid methodgoal programmingmultiple criteria decision makingnondifferentiable optimizationOptimizationpolyhedral combinatoricssubgradient
Conference proceedings and collections of articles (00Bxx) Polytopes and polyhedra (52Bxx) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Management decision making, including multiple objectives (90B50) Mathematical programming (90Cxx)
Recommendations
Cited in
(only showing first 100 items - show all)- A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
- Distributional efficiency in multiobjective stochastic linear programming
- A dual projective simplex method for linear programming
- On finding a vertex solution using interior point methods
- The use of domains in multicriteria decision making
- Implied constraints and an alternate unified development of nonlinear programming theory
- Existence results for special nonlinear total least squares problem
- Optimization of a nonlinear dynamical system for global climate change
- Stochastic linear programs with restricted recourse
- Discrete convex analysis
- A decisional procedure for water resources planning taking into account water quality constraints
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Stabilized column generation
- A stochastic programming model for scheduling maintenance personnel
- A linear constraint satisfaction approach to cost-based abduction
- On the maximum capacity augmentation algorithm for the maximum flow problem
- Directed Steiner problems with connectivity constraints
- Algorithms for finding a \(K\)th best valued assignment
- Computing maximum mean cuts
- A network flow algorithm for just-in-time project scheduling
- On some difficult linear programs coming from set partitioning
- Stochastic annealing for synthesis under uncertainty
- Minimax regret solution to linear programming problems with an interval objective function
- Hybrid heuristic algorithms for set covering.
- Large-scale convex optimization methods for air quality policy assessment.
- The asymmetric traveling salesman problem with replenishment arcs
- Projections of the capacitated network loading problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A polyhedral approach to sequence alignment problems
- Variable metric methods for unconstrained optimization and nonlinear least squares
- An automated system for simulation and parameter identification of inelastic constitutive models
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Mean utility in the assurance region model
- A phase-1 approach for the generalized simplex algorithm
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Near-optimal solutions to large-scale facility location problems
- A basis-defiency-allowing variation of the simplex method for linear programming
- Tighter relaxations for the cutting stock problem
- Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
- Extension of M-convexity and L-convexity to polyhedral convex functions
- A tabu search heuristic and adaptive memory procedure for political districting
- The approximation of separable stochastic programs
- A stochastic approach to stability in stochastic programming
- Possible and necessary optimality tests in possibilistic linear programming problems
- Genetic algorithms and call admission to telecommunications networks
- The existence of optimal parameters of the generalized logistic function
- Automated generation of Kempe linkage and its complexity
- Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
- Generalized derivatives of the optimal value of a linear program with respect to matrix coefficients
- Scheduling divisible loads with time and cost constraints
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Enumeration of support-closed subsets in confluent systems
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Minimizing a stochastic convex function subject to stochastic constraints and some applications
- The skeleton of acyclic Birkhoff polytopes
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Controlling the losing probability in a monotone game
- Numerical analyses of discontinuous material bifurcation: strong and weak discontinuities
- On the modeling of highly localized deformations induced by material failure: the strong discontinuity approach
- Gomory cuts revisited
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- A multi-period machine assignment problem
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- Polynomial solvability of cost-based abduction
- On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- Encyclopedia of optimization. In 6 vols.
- A singularity of fertility decline is Lot-et-Garonne
- Form assessment in coordinate metrology
- Robust shortest path planning and semicontractive dynamic programming
- Mathematical programming. Theory and algorithms.
- Survey of input optimization1
- scientific article; zbMATH DE number 107841 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 492363 (Why is no real title available?)
- scientific article; zbMATH DE number 1157610 (Why is no real title available?)
- An expected regret minimization portfolio selection model
- Optimal plan for multiple debris removal missions
- Optimization interactive. Understanding basics, exploring models and applying methods
- scientific article; zbMATH DE number 1356680 (Why is no real title available?)
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- Polynomial time recognition of essential graphs having stability number equal to matching number
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- Practical Optimization
- A spline smoothing Newton method for finite minimax problems
- Outbound supply chain network design with mode selection and lead time considerations
- A Priori Optimization
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply
- From approximate to exact integer programming
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Relaxation of the rank-1 tensor approximation using different norms
- A new filled function method applied to unconstrained global optimization
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040780)
