Global optimization using special ordered sets
From MaRDI portal
(Redirected from Publication:4096723)
Cites work
Cited in
(53)- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Some branch and bound techniques for nonlinear optimization
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- On maintenance scheduling of production units
- An analytical approach to global optimization
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- Computational comparison on the partitioning strategies in multiple choice integer programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- Service system design with immobile servers, stochastic demand and concave-cost capacity selection
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A local branching heuristic for the open pit mine production scheduling problem
- Modeling the shelter site location problem using chance constraints: a case study for Istanbul
- Integer programming for urban design
- On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty
- An optimal classification method for biological and medical data
- Railway delay management with passenger rerouting considering train capacity constraints
- Strategic bidding in price coupled regions
- Models and solution techniques for production planning problems with increasing byproducts
- A constrained multi-period robust portfolio model with behavioral factors and an interval semi-absolute deviation
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- An optimization algorithm for the inventory routing problem with continuous moves
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- An ejection chain approach for the generalized assignment problem
- Mixed integer models for the stationary case of gas network optimization
- A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
- Piecewise polyhedral formulations for a multilinear term
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Global optimization of mixed-integer signomial programming problems
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- Strategies for LP-based solving a general class of scheduling problems
- An ideal column algorithm for integer programs with special ordered sets of variables
- Formulation of a problem involving assembly lines with multiple manning of work stations
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion
- Branch and bound, integer, and non-integer programming
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Constraint reformulations for set point optimization problems using fuzzy cognitive map models
- Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems
- (Global) optimization: historical notes and recent developments
- Applying topological data analysis to local search problems
- Modeling the road network capacity in a mixed HV and CAV environment
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- A stochastic optimization model for designing disaster relief networks with congestion, disruption and distributional ambiguity
- Optimizing production-transportation-delivery in global supply chain with demand ambiguity by branch-and-cut algorithm
- Polylithic modeling and solution approaches using algebraic modeling systems
- Piecewise linear approximations in the balanced identification of models with differential equations
- A congested facility location problem with strategic customers
- Implementations of special ordered sets in MP software
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
This page was built for publication: Global optimization using special ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096723)
