scientific article
From MaRDI portal
Publication:4040780
zbMATH Open0688.90034MaRDI QIDQ4040780FDOQ4040780
Author name not available (Why is that?)
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (only showing first 100 items - show all)
- A tabu search heuristic and adaptive memory procedure for political districting
- 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
- Encyclopedia of optimization. In 6 vols.
- A linear constraint satisfaction approach to cost-based abduction
- Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach
- An expected regret minimization portfolio selection model
- Robust shortest path planning and semicontractive dynamic programming
- Implied constraints and an alternate unified development of nonlinear programming theory
- Possible and necessary optimality tests in possibilistic linear programming problems
- A network flow algorithm for just-in-time project scheduling
- A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
- 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
- Stabilized column generation
- Minimax regret solution to linear programming problems with an interval objective function
- Incremental assignment problem
- 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
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Polynomial solvability of cost-based abduction
- A Priori Optimization
- Title not available (Why is that?)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- On the maximum capacity augmentation algorithm for the maximum flow problem
- Mathematical programming. Theory and algorithms.
- 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
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Multiple space debris collecting mission: optimal mission planning
- Optimal plan for multiple debris removal missions
- Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
- Stochastic annealing for synthesis under uncertainty
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Discrete convex analysis
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Projections of the capacitated network loading problem
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- The use of domains in multicriteria decision making
- Existence results for special nonlinear total least squares problem
- Gomory cuts revisited
- 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
- A stochastic approach to stability in stochastic programming
- Optimizing Omega
- 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
- An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply
- Survey of input optimization1
- A phase-1 approach for the generalized simplex algorithm
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- 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 tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- A decisional procedure for water resources planning taking into account water quality constraints
- 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
- Minimizing a stochastic convex function subject to stochastic constraints and some applications
- On finding a vertex solution using interior point methods
- Controlling the losing probability in a monotone game
- Near-optimal solutions to large-scale facility location problems
- A new filled function method applied to unconstrained global optimization
- On the modeling of highly localized deformations induced by material failure: the strong discontinuity approach
- Computing maximum mean cuts
- Numerical analyses of discontinuous material bifurcation: strong and weak discontinuities
- Title not available (Why is that?)
- A spline smoothing Newton method for finite minimax problems
- 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
- Title not available (Why is that?)
- Form Assessment in Coordinate Metrology
- Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
- Practical Optimization
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Large-scale convex optimization methods for air quality policy assessment.
- The approximation of separable stochastic programs
- Enumeration of support-closed subsets in confluent systems
- Genetic algorithms and call admission to telecommunications networks
- Generalized derivatives of the optimal value of a linear program with respect to matrix coefficients
- A stochastic programming model for scheduling maintenance personnel
- Relaxation of the rank-1 tensor approximation using different norms
- Algorithms for finding a \(K\)th best valued assignment
- From approximate to exact integer programming
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- The skeleton of acyclic Birkhoff polytopes
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Hybrid heuristic algorithms for set covering.
- Title not available (Why is that?)
- On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty
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)
