The following pages link to OR-Library (Q16337):
Displaying 50 items.
- (Q4395336) (← links)
- (Q4410986) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming (Q4427349) (← links)
- (Q4459806) (← links)
- Cutting optimization with variable-sized stock and inventory status data (Q4468878) (← links)
- Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
- (Q4494081) (← links)
- (Q4495192) (← links)
- (Q4495496) (← links)
- (Q4517276) (← links)
- (Q4530019) (← links)
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Q4530641) (← links)
- A Set Partitioning Approach to the Crew Scheduling Problem (Q4545655) (← links)
- Prospect theory–based portfolio optimization: an empirical study and analysis using intelligent algorithms (Q4555083) (← links)
- (Q4577935) (← links)
- A heuristic algorithm for the set covering problem (Q4645914) (← links)
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS (Q4650598) (← links)
- Genetic algorithms for the bus driver scheduling problem: a case study (Q4656631) (← links)
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem (Q4656683) (← links)
- An indirect genetic algorithm for set covering problems (Q4656729) (← links)
- Preprocessing rules for integer programming solutions to the generalised assignment problem (Q4658442) (← links)
- Displacement problem and dynamically scheduling aircraft landings (Q4661228) (← links)
- Checkerboard pattern: proposals for its generation (Q4669796) (← links)
- (Q4716341) (← links)
- (Q4719356) (← links)
- (Q4737359) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- (Q4785575) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
- (Q4836345) (← links)
- Branch-and-Bound Algorithms for a Regional Water Authority Distribution Problem (Q4849288) (← links)
- Facility location and capacity acquisition: An integrated approach (Q4859573) (← links)
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856) (← links)
- (Q4900816) (← links)
- A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization (Q4909103) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
- Parallel metaheuristics: recent advances and new trends (Q4921253) (← links)
- Integrating heuristic information into exact methods: The case of the vertex p-centre problem (Q4933644) (← links)
- (Q4945796) (← links)
- (Q4945802) (← links)
- (Q4945803) (← links)
- (Q4952698) (← links)
- (Q4955265) (← links)
- A hybrid data mining metaheuristic for the <i>p</i>‐median problem (Q4969775) (← links)
- Using multiflow formulations to solve the Steiner tree problem in graphs (Q5002224) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times (Q5058834) (← links)
- An efficient algorithm for solving the median problem on real road networks (Q5059369) (← links)
