MINTO, a Mixed INTeger Optimizer
From MaRDI portal
Publication:1331882
DOI10.1016/0167-6377(94)90013-2zbMath0806.90095OpenAlexW2808512824MaRDI QIDQ1331882
Gabriele C. Sigismondi, Nemhauser, George I., Savelsbergh, Martin W. P.
Publication date: 19 February 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/minto-a-mixed-integer-optimizer(cb9f7ec3-72d3-4128-8de8-9fa8b862834b).html
Related Items
Solving binary cutting stock problems by column generation and branch- and-bound, Solving \(0/1\) integer programs with enumeration cutting planes, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Lifted cover facets of the 0-1 knapsack polytope with GUB constraints, Computing minimal forecast horizons: an integer programming approach, On solving large instances of the capacitated facility location problem, Mixed integer nonlinear programming tools: an updated practical overview, Some properties of cliques in 0-1 mixed integer programs, The pickup and delivery problem: Faces and branch-and-cut algorithm, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Transferring information across restarts in MIP, New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems, OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, A Survey of the Generalized Assignment Problem and Its Applications, Orbital branching, Lift-and-project cuts for convex mixed integer nonlinear programs, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., PEBBL: an object-oriented framework for scalable parallel branch and bound, Domain reduction techniques for global NLP and MINLP optimization, Dantzig-Wolfe decomposition and branch-and-price solving in G12, An LPCC approach to nonconvex quadratic programs, Unnamed Item, Branching in branch-and-price: A generic scheme, Preprocessing and cutting for multiple allocation hub location problems., The multidimensional 0-1 knapsack problem: an overview., Second-order cover inequalities, From High-Level Model to Branch-and-Price Solution in G12, A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs, Conflict graphs in solving integer programming problems, A note on splitting of variables in integer programming models, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Box-constrained quadratic programs with fixed charge variables, Strong-branching inequalities for convex mixed integer nonlinear programs, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Integer multicommodity flow problems, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, Algebraic modeling for IP and MIP (GAMS), Hooked on IP, On solving complex multi-period location models using simulated annealing., Cutting planes in integer and mixed integer programming, A set packing model for the ground holding problem in congested networks, Information-based branching schemes for binary linear mixed integer problems, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, A family of facets for the uncapacitated \(p\)-median polytope, Scheduling projects with labor constraints, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, A family of inequalities for the generalized assignment polytope, Flow pack facets of the single node fixed-charge flow polytope, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Cliques and clustering: A combinatorial approach, Polyhedral techniques in combinatorial optimization I: Theory, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Introduction to ABACUS -- a branch-and-cut system, Branch-and-price approach for prescribing profitable feature upgrades, Optimal lines for railway systems, Mixed integer nonlinear programming tools: a practical overview, The asymmetric traveling salesman problem with replenishment arcs, Capacitated facility location: Separation algorithms and computational experience, Plant location with minimum inventory, Disruption management in the airline industry-concepts, models and methods, A global optimization and adaptivity-based algorithm for automated edge grid generation, On surrogating 0-1 knapsack constraints, Combinatorial optimization: current successes and directions for the future, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Optimisation of the interconnecting network of a UMTS radio mobile telephone system, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
