Pages that link to "Item:Q697578"

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)
• Cutting planes from extended LP formulations (Q507316) (← 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)
• Generating cuts in integer programming with families of special ordered sets (Q922293) (← 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 \(0-1\) programming based on cardinality cuts (Q976440) (← links)
• Valid inequalities for mixed integer linear programs (Q995784) (← 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)
• Valid inequalities for mixed 0-1 programs (Q1076609) (← 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 for integer programs with general integer variables (Q1290616) (← links)
• Logic cuts for processing networks with fixed charges (Q1317071) (← links)
• Primal cutting plane algorithms revisited (Q1396918) (← links)
• Strong formulations for mixed integer programs: valid inequalities and extended formulations (Q1403296) (← links)
• T-space and cutting planes (Q1424274) (← 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)
• Local search inequalities (Q1751111) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← 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)
• Design and verify: a new scheme for generating cutting-planes (Q2248750) (← 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)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
• Sawing planning using a multicriteria approach (Q2379779) (← links)