Pages that link to "Item:Q3565245"

The following pages link to Mixed Integer Programming Computation (Q3565245):

Displaying 42 items.

• Improving branch-and-cut performance by random sampling (Q266414) (← links)
• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
• Structured learning modulo theories (Q511777) (← links)
• Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
• Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
• A first look at picking dual variables for maximizing reduced cost fixing (Q2011594) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
• A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis (Q2161424) (← links)
• Measures of balance in combinatorial optimization (Q2168777) (← links)
• The split closure of a strictly convex body (Q2275578) (← links)
• Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
• \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• On learning and branching: a survey (Q2408515) (← links)
• Rejoinder on: ``On learning and branching: a survey'' (Q2408517) (← links)
• A bit-vector differential model for the modular addition by a constant (Q2692348) (← links)
• Mixed integer linear programming formulation techniques (Q2808240) (← links)
• Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
• Aggregation and Mixed Integer Rounding to Solve MIPs (Q3635007) (← links)
• (Q3780773) (← links)
• (Q4233341) (← links)
• (Q4735935) (← links)
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
• Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
• JOINT OPTIMIZATION OF TRANSITION RULES AND THE PREMIUM SCALE IN A BONUS-MALUS SYSTEM (Q5140079) (← links)
• Evaluating and tuning \(n\)-fold integer programming (Q5140719) (← links)
• An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints (Q5147029) (← links)
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
• A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
• An integer linear programming approach to solving the Eternity puzzle (Q6076354) (← links)
• Progress in mathematical programming solvers from 2001 to 2020 (Q6114935) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
• Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
• Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems (Q6175620) (← links)
• Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)