Pages that link to "Item:Q697578"

The following pages link to Cutting planes in integer and mixed integer programming (Q697578):

Displaying 29 items.

• Local cuts for mixed-integer programming (Q2392934) (← links)
• Fuzzy clustering: more than just fuzzification (Q2397885) (← links)
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Sequential pairing of mixed integer inequalities (Q2471272) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• A compact formulation of a mixed-integer set (Q2786320) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
• Spherical cuts for integer programming problems (Q3499437) (← links)
• Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming (Q3706846) (← links)
• On the redundancy of cutting planes for linear complementarity problems (Q3716850) (← links)
• Fenchel Cutting Planes for Integer Programs (Q4287599) (← links)
• (Q4518860) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
• Learning Data Manifolds with a Cutting Plane Method (Q5157241) (← links)
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
• Computational Integer Programming and Cutting Planes (Q5292084) (← links)
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5906949) (← links)
• Elementary closures for integer programs. (Q5937498) (← links)
• Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms (Q6168341) (← links)
• Adaptive cut selection in mixed-integer linear programming (Q6168887) (← links)
• Enhancing cut selection through reinforcement learning (Q6564771) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)