MINTO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Disruption management in the airline industry-concepts, models and methods
- Cliques and clustering: A combinatorial approach
- Reformulation of capacitated facility location problems: How redundant information can help
- Introduction to ABACUS -- a branch-and-cut system
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Optimal lines for railway systems
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Capacitated facility location: Separation algorithms and computational experience
- Cutting planes for mixed-integer knapsack polyhedra
- Plant location with minimum inventory
- FATCOP
- On surrogating 0-1 knapsack constraints
- Solving binary cutting stock problems by column generation and branch- and-bound
- MINTO, a Mixed INTeger Optimizer
- Solving \(0/1\) integer programs with enumeration cutting planes
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Implementation of an integer optimization platform using object oriented programming
- A branch-and-price algorithm for solving the cutting strips problem
- Piece-wise linear approximation of functions of two variables
- Some properties of cliques in 0-1 mixed integer programs
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A polyhedral study of the cardinality constrained knapsack problem
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- The flow shop scheduling polyhedron with setup times
- Parallel branch, cut, and price for large-scale discrete optimization
- Preprocessing and cutting for multiple allocation hub location problems.
- The multidimensional 0-1 knapsack problem: an overview.
- PICO
- ABACUS
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- The asymmetric traveling salesman problem with replenishment arcs
- Lifted flow cover inequalities for mixed 0-1 integer programs
- A polyhedral approach to single-machine scheduling problems.
- Combinatorial optimization: current successes and directions for the future
- A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints
- Zimpl
- MIPLIB
- PVM
- SYMPHONY
- Knapsack
- Lift-and-project cuts for convex mixed integer nonlinear programs
- XPRESS
- Domain reduction techniques for global NLP and MINLP optimization
- MINOPT
- BonsaiG
- LogMIP
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- FilMINT
- BQPD
- minlpBB
- BiCePS
- 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
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- CHiPPS
- A brief history of linear and mixed-integer programming computation
- 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
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- MacMINLP
- NOA
- MOPS
- A global optimization and adaptivity-based algorithm for automated edge grid generation
- OSL
- Transferring information across restarts in MIP
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- BaPCod
- GENCOL
- bc-prod
- Information-based branching schemes for binary linear mixed integer problems
- Faster MIP solutions via new node selection rules
- Mixed integer nonlinear programming tools: an updated practical overview
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- A variable neighborhood decomposition search method for supply chain management planning problems
- COIN/BCP
- LOLIB
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
- CMU-IBM
- FATCOP: A fault tolerant condor-PVM mixed integer programming solver
- PICO: An object-oriented framework for parallel branch and bound
- Branch-and-price: Column generation for solving huge integer programs
- DRIVE: Dynamic routing of independent vehicles
- Flight string models for aircraft fleeting and routing
- An optimization based heuristic for political districting
- Efficient intelligent backtracking using linear programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Computational experience with a software framework for parallel integer programming
- Modelling practical lot-sizing problems as mixed-integer programs
- Exact solutions to task allocation problems
- Octane
- bc-opt
This page was built for software: MINTO
