The following pages link to MINTO, a Mixed INTeger Optimizer (Q1331882):
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)
- 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)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- Optimal lines for railway systems (Q1278454) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← 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)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← 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)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (Q1869690) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages (Q1918922) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- A note on splitting of variables in integer programming models (Q1972004) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- A global optimization and adaptivity-based algorithm for automated edge grid generation (Q2090704) (← links)
