Pages that link to "Item:Q4427374"

The following pages link to A Computational Study of Search Strategies for Mixed Integer Programming (Q4427374):

Displaying 36 items.

• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• A power-deficiency and risk-management model for wind farm micro-siting using cyber swarm algorithm (Q2289167) (← links)
• A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
• An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning (Q2370363) (← links)
• Subadditive approaches in integer programming (Q2371344) (← links)
• Local cuts for mixed-integer programming (Q2392934) (← links)
• On learning and branching: a survey (Q2408515) (← links)
• A partial outer convexification approach to control transmission lines (Q2419514) (← links)
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools (Q2440188) (← links)
• Computational protein design as an optimization problem (Q2453727) (← links)
• Exact solutions to linear programming problems (Q2467437) (← links)
• Improving strong branching by domain propagation (Q2513744) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• Achieving consistency with cutting planes (Q2687054) (← links)
• Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing (Q2830758) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• Production flow prototyping subject to imprecise activity specification (Q3451513) (← links)
• Computing with Multi-row Gomory Cuts (Q3503849) (← links)
• (Q4577935) (← links)
• From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
• Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
• Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• Optimization Bounds from the Branching Dual (Q5139843) (← links)
• On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
• An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts (Q5254996) (← links)
• Tree search algorithm for assigning cooperating UAVs to multiple tasks (Q5443601) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
• A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
• Progressively strengthening and tuning MIP solvers for reoptimization (Q6590467) (← links)
• Bayesian Inference Using the Proximal Mapping: Uncertainty Quantification Under Varying Dimensionality (Q6631685) (← links)