Pages that link to "Item:Q537580"

The following pages link to Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580):

Displaying 41 items.

• Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators (Q286692) (← links)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
• Boosting the feasibility pump (Q495939) (← links)
• A note on the split rank of intersection cuts (Q647399) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• On the safety of Gomory cut generators (Q744203) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
• Optimization methods for petroleum fields development and production systems: a review (Q1642989) (← links)
• Confidence intervals for linear unbiased estimators under constrained dependence (Q1657953) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• Using diversification, communication and parallelism to solve mixed-integer linear programs (Q1667215) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• An optimal solution to a three echelon supply chain network with multi-product and multi-period (Q1994505) (← links)
• Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
• An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Optimization-based dispatching policies for open-pit mining (Q2129198) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• Split cuts from sparse disjunctions (Q2195684) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
• Scheduling of maintenance windows in a mining supply chain rail network (Q2289897) (← links)
• A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
• Stochastic Cutting Planes for Data-Driven Optimization (Q5057985) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
• Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
• Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
• Optimization over decision trees: a case study for the design of stable direct-current electricity networks (Q6088547) (← links)
• Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
• A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
• Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation (Q6200799) (← links)