Pages that link to "Item:Q4096723"

The following pages link to Global optimization using special ordered sets (Q4096723):

Displaying 49 items.

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