The following pages link to OR-Library (Q16337):
Displaying 50 items.
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX<sup>®</sup> (Q5059432) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- (Q5065768) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
- Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation (Q5116556) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Interactive Multiple Criteria Decision Making for Large-Scale Multi-Objective Optimization Problems (Q5144884) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- (Q5152624) (← links)
- (Q5154472) (← links)
- (Q5154491) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)
- A Method for Robust Index Tracking (Q5232790) (← links)
- Support Vector Regression for Time Series Analysis (Q5232792) (← links)
- A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
- A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
- (Q5299266) (← links)
- (Q5320592) (← links)
- The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
- (Q5367892) (← links)
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039) (← links)
- Genetic algorithms for job shop scheduling problems with alternative routings (Q5385504) (← links)
- Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation (Q5387400) (← links)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (Q5429275) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
- (Q5437767) (← links)
- (Q5447760) (← links)
- (Q5448010) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5501230) (← links)
- (Q5697112) (← links)
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing (Q5704177) (← links)
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse (Q5739131) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5901720) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy (Q5928213) (← links)
- Algorithms for the set covering problem (Q5933825) (← links)
- Maximally disjoint solutions of the set covering problem (Q5937018) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
