MINTO

swMATH4587MaRDI QIDQ16758FDOQ16758

Author name not available (Why is that?)

Official website: http://coral.ie.lehigh.edu/~minto//

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

• Title not available (Why is that?)
• Capacitated facility location: Separation algorithms and computational experience
• Mixed integer nonlinear programming tools: a practical overview
• 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
• Lift-and-project cuts for convex mixed integer nonlinear programs
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Box-constrained quadratic programs with fixed charge variables
• Reformulation of capacitated facility location problems: How redundant information can help
• Scheduling projects with labor constraints
• Computing minimal forecast horizons: an integer programming approach
• New constructs for the description of combinatorial optimization problems in algebraic modeling languages
• Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
• Cutting planes for mixed-integer knapsack polyhedra
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• A family of facets for the uncapacitated \(p\)-median polytope
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Second-order cover inequalities
• 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
• Polyhedral techniques in combinatorial optimization I: Theory
• On solving large instances of the capacitated facility location problem
• A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
• On surrogating 0-1 knapsack constraints
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Title not available (Why is that?)
• The flow shop scheduling polyhedron with setup times
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Introduction to ABACUS -- a branch-and-cut system
• Strong-branching inequalities for convex mixed integer nonlinear programs
• Title not available (Why is that?)
• Parallel branch, cut, and price for large-scale discrete optimization
• Title not available (Why is that?)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• MODLER
• Multimodal Express Package Delivery: A Service Network Design Application
• Information-based branching schemes for binary linear mixed integer problems
• Title not available (Why is that?)
• Integer multicommodity flow problems
• The Age of Optimization: Solving Large-Scale Real-World Problems
• Implementation of an integer optimization platform using object oriented programming
• A branch-and-price algorithm for solving the cutting strips problem
• Some properties of cliques in 0-1 mixed integer programs
• 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
• Optimisation of the interconnecting network of a UMTS radio mobile telephone system
• Computational Integer Programming and Cutting Planes
• A note on splitting of variables in integer programming models
• A family of inequalities for the generalized assignment polytope
• FATCOP: A fault tolerant condor-PVM mixed integer programming solver
• A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints
• The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Title not available (Why is that?)
• Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
• Dantzig-Wolfe decomposition and branch-and-price solving in G12
• Branch-and-price approach for prescribing profitable feature upgrades
• Transferring information across restarts in MIP
• On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
• Domain reduction techniques for global NLP and MINLP optimization
• A global optimization and adaptivity-based algorithm for automated edge grid generation
• Faster MIP solutions via new node selection rules
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• 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
• 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.
• 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
• Title not available (Why is that?)
• 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
• 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
• FATCOP

This page was built for software: MINTO