Global optimization using special ordered sets

Cites Work

Cited In (49)

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

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)