Pages that link to "Item:Q697578"
From MaRDI portal
The following pages link to Cutting planes in integer and mixed integer programming (Q697578):
Displaying 50 items.
- A deterministic method for the unit commitment problem in power systems (Q342197) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← 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)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← 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)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- The application of preprocessing and cutting plane techniques for a class of production planning problems (Q1273528) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Cutting planes from a mixed integer Farkas lemma. (Q1426721) (← 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)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← 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)
- Sawing planning using a multicriteria approach (Q2379779) (← 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)
- 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)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← 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)
