MINTO

swMATH4587MaRDI QIDQ16758FDOQ16758

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Faster MIP solutions via new node selection rules
• Capacitated facility location: Separation algorithms and computational experience
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Mixed integer nonlinear programming tools: a practical overview
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• A variable neighborhood decomposition search method for supply chain management planning problems
• A polyhedral study of the cardinality constrained knapsack problem
• PICO: An object-oriented framework for parallel branch and bound
• Flight string models for aircraft fleeting and routing
• A Column Generation Approach for Graph Coloring
• FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
• Lift-and-project cuts for convex mixed integer nonlinear programs
• A set packing model for the ground holding problem in congested networks
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• An optimization based heuristic for political districting
• A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Branching in branch-and-price: A generic scheme
• Preprocessing and cutting for multiple allocation hub location problems.
• A family of facets for the uncapacitated \(p\)-median polytope
• Efficient intelligent backtracking using linear programming
• The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Second-order cover inequalities
• Title not available (Why is that?)
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Orbital branching
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• Composite Variable Formulations for Express Shipment Service Network Design
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• Solving \(0/1\) integer programs with enumeration cutting planes
• An LPCC approach to nonconvex quadratic programs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Combinatorial optimization: current successes and directions for the future
• Title not available (Why is that?)
• Disruption management in the airline industry-concepts, models and methods
• Optimal lines for railway systems
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Title not available (Why is that?)
• Piece-wise linear approximation of functions of two variables
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• A brief history of linear and mixed-integer programming computation
• Conflict graphs in solving integer programming problems
• Modelling topology optimization problems as linear mixed 0-1 programs
• Exact solutions to task allocation problems
• On solving complex multi-period location models using simulated annealing.
• Flow pack facets of the single node fixed-charge flow polytope
• Valid inequalities for problems with additive variable upper bounds
• A branch and cut approach to the cardinality constrained circuit problem.
• Branch-and-price: Column generation for solving huge integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Introduction to ABACUS -- a branch-and-cut system
• A Computational Study of Search Strategies for Mixed Integer Programming
• Strong-branching inequalities for convex mixed integer nonlinear programs
• FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• The multidimensional 0-1 knapsack problem: an overview.
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Solving binary cutting stock problems by column generation and branch- and-bound
• Cutting planes in integer and mixed integer programming
• Effective Heuristics for Multiproduct Partial Shipment Models
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• The asymmetric traveling salesman problem with replenishment arcs
• A polyhedral approach to single-machine scheduling problems.
• Information-based branching schemes for binary linear mixed integer problems
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Cliques and clustering: A combinatorial approach
• Plant location with minimum inventory
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• Title not available (Why is that?)
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• DRIVE: Dynamic routing of independent vehicles
• 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
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
• Modelling practical lot-sizing problems as mixed-integer programs
• Computational Integer Programming and Cutting Planes
• MINTO, a Mixed INTeger Optimizer
• Mixed integer nonlinear programming tools: an updated practical overview
• A family of inequalities for the generalized assignment polytope
• FATCOP: A fault tolerant condor-PVM mixed integer programming solver
• Title not available (Why is that?)
• A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
• Algebraic modeling for IP and MIP (GAMS)
• Hooked on IP
• Computational experience with a software framework for parallel integer programming
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints

This page was built for software: MINTO