Pages that link to "Item:Q2848171"

The following pages link to Solving Mixed Integer Bilinear Problems Using MILP Formulations (Q2848171):

Displaying 38 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Scheduling under linear constraints (Q323163) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← links)
• Modeling max-min fair bandwidth allocation in BitTorrent communities (Q513724) (← links)
• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• Generalized average shadow prices and bottlenecks (Q1616793) (← links)
• Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• A mean-risk mixed integer nonlinear program for transportation network protection (Q1681354) (← links)
• Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
• A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
• On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
• An integer linear programming approach for a class of bilinear integer programs (Q1785220) (← links)
• Public R\&D project portfolio selection problem with cancellations (Q2014587) (← links)
• Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
• Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Robust assortment optimization under sequential product unavailability (Q2160489) (← links)
• Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860) (← links)
• Optimal insurance contract specification in the upstream sector of the oil and gas industry (Q2239920) (← links)
• A robust decision-support method based on optimization and simulation for wildfire resilience in highly renewable power systems (Q2240009) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• Stochastic dual dynamic integer programming (Q2414913) (← links)
• A bi-objective mathematical model for integrated planning of sugarcane harvesting and transport operations (Q2669513) (← links)
• The bipartite Boolean quadric polytope (Q2673249) (← links)
• A Bayesian framework for molecular strain identification from mixed diagnostic samples (Q4582733) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
• The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• Multi-objective optimization for integrated sugarcane cultivation and harvesting planning (Q6167760) (← links)
• Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)