Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
From MaRDI portal
Recommendations
Cited in
(53)- Evolution and state-of-the-art in integer programming
- On identifying dominant cliques.
- The k-aggregation closure for covering sets
- Efficient preprocessing for VLSI optimization problems
- An enumerative procedure for identifying maximal covers
- Flight test data cycle map optimisation
- New linearizations of quadratic assignment problems
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
- Production planning with approved vendor matrices for a hard-disk drive manufacturer
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- Relations between facets of low- and high-dimensional group problems
- Efficient solutions for special zero-one programming problems
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A note on the split rank of intersection cuts
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Management of resource sharing in emergency response using data-driven analytics
- Combining revenue and equity in capacity allocation of imaging facilities
- A branch-and-cut algorithm for the Steiner tree problem with delays
- Theoretical challenges towards cutting-plane selection
- Detecting constraint redundancy in 0-1 linear programming problems
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
- Challenges in Enterprise Wide Optimization for the Process Industries
- Mathematical programming models for some smallest-world problems
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- A MILP model for the teacher assignment problem considering teachers' preferences
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Mixed integer linear programming formulation techniques
- On separating cover inequalities for the multidimensional knapsack problem
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Decomposition, reformulation, and diving in university course timetabling
- The impact of distribution system characteristics on computational tractability
- An integer programming formulation for a case study in university timetabling.
- The multidimensional 0-1 knapsack problem: an overview.
- Cutting planes in integer and mixed integer programming
- Sequence independent lifting for mixed integer programs with variable upper bounds
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- Finding multiple solutions to general integer linear programs
- Experimental Results on the New Techniques for Integer Programming Formulations
- scientific article; zbMATH DE number 1538621 (Why is no real title available?)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Integer Linear Programming in Computational and Systems Biology
- scientific article; zbMATH DE number 1383149 (Why is no real title available?)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Comparison between linear programming and integer linear programming: a review
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
This page was built for publication: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427317)
