Pages that link to "Item:Q697578"

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

Displaying 39 items.

• A deterministic method for the unit commitment problem in power systems (Q342197) (← links)
• A note on the split rank of intersection cuts (Q647399) (← links)
• Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
• Testing cut generators for mixed-integer linear programming (Q734353) (← links)
• A combinatorial optimization approach to the selection of statistical units (Q747022) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
• The mixing-MIR set with divisible capacities (Q930344) (← links)
• Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• A real coded genetic algorithm for solving integer and mixed integer optimization problems (Q1026327) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
• Fiber cable network design in tree networks (Q1749517) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
• An outer-approximation guided optimization approach for constrained neural network inverse problems (Q2097633) (← links)
• Transferring information across restarts in MIP (Q2170173) (← links)
• On disks of the triangular grid: an application of optimization theory in discrete geometry (Q2185738) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
• A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations (Q2230799) (← links)
• Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
• Feasibility pump algorithm for sparse representation under Laplacian noise (Q2298553) (← links)
• The green vehicle routing problem with capacitated alternative fuel stations (Q2329714) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← 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)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• A compact formulation of a mixed-integer set (Q2786320) (← links)
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← 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)
• 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)