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