Pages that link to "Item:Q2808240"

The following pages link to Mixed Integer Linear Programming Formulation Techniques (Q2808240):

Displaying 42 items.

• New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
• Online over time processing of combinatorial problems (Q1617394) (← links)
• Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
• Computation of weighted sums of rewards for concurrent MDPs (Q1731592) (← links)
• An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• Reachability in parametric interval Markov chains using constraints (Q1786613) (← links)
• Ellipsoidal mixed-integer representability (Q1801008) (← links)
• Behavioral modeling in weight loss interventions (Q1991236) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
• Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• A rounding theorem for unique binary tomographic reconstruction (Q2274077) (← links)
• A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
• Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
• Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
• Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
• Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
• On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
• Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
• Risk Averse Stackelberg Security Games with Quantal Response (Q3179192) (← links)
• On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
• Mixed-Integer Convex Representability (Q5076722) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
• Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
• Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• Optimization of Tree Ensembles (Q5144785) (← links)
• Optimization over decision trees: a case study for the design of stable direct-current electricity networks (Q6088547) (← links)
• A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)
• A unified framework for bivariate clustering and regression problems via mixed-integer linear programming (Q6103471) (← links)
• Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
• Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation (Q6200799) (← links)