Pages that link to "Item:Q4427317"

The following pages link to Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317):

Displaying 41 items.

• A MILP model for the teacher assignment problem considering teachers' preferences (Q321129) (← links)
• Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
• A note on the split rank of intersection cuts (Q647399) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Production planning with approved vendor matrices for a hard-disk drive manufacturer (Q706906) (← links)
• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
• A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach (Q723935) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
• Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
• Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
• Efficient solutions for special zero-one programming problems (Q995926) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
• An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Combining revenue and equity in capacity allocation of imaging facilities (Q1752240) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• On identifying dominant cliques. (Q1811147) (← links)
• Flight test data cycle map optimisation (Q1869666) (← links)
• A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• Finding multiple solutions to general integer linear programs (Q2384650) (← links)
• Mathematical programming models for some smallest-world problems (Q2572112) (← links)
• Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems (Q2576243) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• Optimal decision trees for the algorithm selection problem: integer programming based approaches (Q6092614) (← links)
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
• Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation (Q6200799) (← links)