Pages that link to "Item:Q817202"

The following pages link to Integer-programming software systems (Q817202):

Displaying 26 items.

• On polynomial kernels for sparse integer linear programs (Q269481) (← links)
• A MILP model for the teacher assignment problem considering teachers' preferences (Q321129) (← links)
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
• A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
• The type E simple assembly line balancing problem: a mixed integer linear programming formulation (Q342081) (← links)
• Generalized resolution search (Q429682) (← links)
• Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) (← links)
• Modeling and control of switching max-plus-linear systems with random and deterministic switching (Q692382) (← links)
• An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
• A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion (Q1632000) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
• Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Faster MIP solutions via new node selection rules (Q2270439) (← links)
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
• Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
• A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity (Q3452840) (← links)
• JuMP: A Modeling Language for Mathematical Optimization (Q5738130) (← links)
• Optimal decision trees for the algorithm selection problem: integer programming based approaches (Q6092614) (← links)