Cited in
(only showing first 100 items - show all)- A family of inequalities for the generalized assignment polytope
- FATCOP: A fault tolerant condor-PVM mixed integer programming solver
- Faster MIP solutions via new node selection rules
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- Capacitated facility location: Separation algorithms and computational experience
- Mixed integer nonlinear programming tools: a practical overview
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Algebraic modeling for IP and MIP (GAMS)
- Hooked on IP
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A variable neighborhood decomposition search method for supply chain management planning problems
- Computational experience with a software framework for parallel integer programming
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- 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 to delivery planning over time with inhomogeneous service providers and service interval constraints
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- A Column Generation Approach for Graph Coloring
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Box-constrained quadratic programs with fixed charge variables
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- A set packing model for the ground holding problem in congested networks
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Reformulation of capacitated facility location problems: How redundant information can help
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Computing minimal forecast horizons: an integer programming approach
- An optimization based heuristic for political districting
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- Scheduling projects with labor constraints
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- Branching in branch-and-price: A generic scheme
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Cutting planes for mixed-integer knapsack polyhedra
- Preprocessing and cutting for multiple allocation hub location problems.
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach
- Efficient intelligent backtracking using linear programming
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- A family of facets for the uncapacitated \(p\)-median polytope
- Second-order cover inequalities
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- scientific article; zbMATH DE number 892152 (Why is no real title available?)
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- Orbital branching
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- On solving large instances of the capacitated facility location problem
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem
- Polyhedral techniques in combinatorial optimization I: Theory
- Composite Variable Formulations for Express Shipment Service Network Design
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Solving \(0/1\) integer programs with enumeration cutting planes
- An LPCC approach to nonconvex quadratic programs
- On surrogating 0-1 knapsack constraints
- scientific article; zbMATH DE number 2227477 (Why is no real title available?)
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Combinatorial optimization: current successes and directions for the future
- Disruption management in the airline industry-concepts, models and methods
- FATCOP
- PICO
- ABACUS
- MIPLIB
- PVM
- Zimpl
- Knapsack
- BonsaiG
- MINOPT
- SYMPHONY
- LogMIP
- XPRESS
- BQPD
- FilMINT
- minlpBB
- BiCePS
- CHiPPS
- MacMINLP
- NOA
- MOPS
- OSL
- BaPCod
- GENCOL
- bc-prod
- COIN/BCP
- LOLIB
- CMU-IBM
- Octane
- bc-opt
- LOTSIZELIB
- FCNetLib
- Performance Libraries
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 1961991 (Why is no real title available?)
- Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
This page was built for software: MINTO
