The following pages link to MINTO (Q16758):
Displaying 50 items.
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems (Q374673) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- Hooked on IP (Q537605) (← links)
- Orbital branching (Q623461) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Computing minimal forecast horizons: an integer programming approach (Q853795) (← links)
- On solving large instances of the capacitated facility location problem (Q859676) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Disruption management in the airline industry-concepts, models and methods (Q1046689) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Reformulation of capacitated facility location problems: How redundant information can help (Q1270613) (← links)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- Optimal lines for railway systems (Q1278454) (← links)
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (Q1288467) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- On surrogating 0-1 knapsack constraints (Q1304781) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- MINTO, a Mixed INTeger Optimizer (Q1331882) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487) (← links)
- Implementation of an integer optimization platform using object oriented programming (Q1362956) (← links)
- A branch-and-price algorithm for solving the cutting strips problem (Q1364894) (← links)
- Piece-wise linear approximation of functions of two variables (Q1365113) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
- Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
- A polyhedral study of the cardinality constrained knapsack problem (Q1404231) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- The flow shop scheduling polyhedron with setup times (Q1417853) (← links)
- Parallel branch, cut, and price for large-scale discrete optimization (Q1424299) (← links)
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
