Pages that link to "Item:Q4136935"

The following pages link to Experiments in mixed-integer linear programming using pseudo-costs (Q4136935):

Displaying 23 items.

• SCIP: solving constraint integer programs (Q734351) (← links)
• Implementations of special ordered sets in MP software (Q792884) (← links)
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• On maintenance scheduling of production units (Q1159562) (← links)
• A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
• Faster MIP solutions via new node selection rules (Q2270439) (← links)
• Improving strong branching by domain propagation (Q2513744) (← links)
• The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
• An ideal column algorithm for integer programs with special ordered sets of variables (Q3666590) (← links)
• Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)
• Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion (Q3901311) (← links)
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
• Measuring the Impact of Branching Rules for Mixed-Integer Programming (Q4685753) (← links)
• Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
• Optimization Bounds from the Branching Dual (Q5139843) (← links)
• Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)