about
The dual role of fragments in fragment-assembly methods for de novo protein structure prediction.Column generation algorithms for exact modularity maximization in networks.A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.Structural Identifiability of Dynamic Systems Biology Models.Parameter identifiability analysis and visualization in large-scale kinetic models of biosystemsA simulated annealing heuristic for maximum correlation core/periphery partitioning of binary networksDeveloping Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation.Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.Gaussian model-based partitioning using iterated local search.Iterated local search algorithm for solving the orienteering problem with soft time windowsThe school bus routing and scheduling problem with transfers.A hybrid approach for integrated healthcare cooperative purchasing and supply chain configuration.A Quantum Inspired GVNS: Some Preliminary Results.Restarted local search algorithms for continuous black box optimization.A variable neighborhood Walksat-based algorithm for MAX-SAT problems.Metaheuristics-the metaphor exposedAdaptive memory programming: local search parallel algorithms for phylogenetic tree constructionA hybrid algorithm based on variable neighbourhood for the strip packing problemOtimização na alocação dinâmica de veículos no transporte rodoviário de cargas completas entre terminaisAn improved approach for determination of index positions on CNC magazines with cutting tool duplications by integrating shortest path algorithmMulti-objective variable neighborhood search: an application to combinatorial optimization problemsHeuristic particle filter: applying abstraction techniques to the design of visual tracking algorithmsA Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree ProblemOrder-based error for managing ensembles of surrogates in mesh adaptive direct searchDynamic scaling in the mesh adaptive direct search algorithm for blackbox optimizationUse of quadratic models with mesh-adaptive direct search for constrained black box optimizationVehicle routing with compartments: applications, modelling and heuristicsA Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problemsHybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing ProblemConsistent Neighborhood Search for Combinatorial OptimizationAn Exact Algorithm for Blockmodeling of Two-Mode Network DataA Variable Neighborhood Search Algorithm for the Leather Nesting ProblemA VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-SectionVariable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating JobsA Modified -Median Model for the Emergency Facilities Location Problem and Its Variable Neighbourhood Search-Based AlgorithmA Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random BreakdownA Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City LogisticsA Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time WindowsA Hybrid Algorithm for the Permutation Flowshop Scheduling Problem without Intermediate BuffersDRSCRO: A Metaheuristic Algorithm for Task Scheduling on Heterogeneous Systems
P2860
Q30409630-18D72E7B-3231-4696-B5EC-A0E542C5F87DQ33792104-0CFDE577-3708-4D2B-9D20-1286C6B23260Q35551829-213B27BE-3414-4487-9B5D-3A274112F8D4Q36177104-C30B8364-F16F-4950-AAEE-870AC119F440Q36364489-E5C9BB70-F6C3-4C66-8564-950A8D6DF355Q36366961-018A00A0-0B54-4810-82E8-A0947906C12BQ36763750-9DD8A03A-4490-4DE2-8F13-845CCA1E013AQ38858536-93653170-968C-4417-951D-1A0293C1C476Q38994137-D24477FC-70A8-48F4-AC6E-AF3A5FB9CB59Q41444257-52DEA23C-0AA5-4BEC-ABD6-C10D88B64E9CQ41814872-4E1A92E3-A637-4962-BF61-837D8BCCCD42Q42634975-87C17D41-5EC6-4B6C-853B-AF0C5805ED7AQ47663716-2EA22CF4-E1B6-4723-B310-6F79E630C79DQ51345520-DA1C2228-341E-4001-AC9B-53AFEA03FFC3Q55692873-F9A3FB72-348C-4A12-BB80-853721DD0AD2Q56431130-838F1102-6771-48D3-9317-58B38AF55136Q57387729-1A8BB5D1-2E52-41AC-9F8D-569561EAF7C9Q57569978-0F8A9357-79C6-4EBB-895A-FD2AF8DEDC9CQ57719429-FBBC8EF5-9D52-4FDC-AEC9-F6A4C2E9DA6BQ57747646-F1C999A2-5893-4C64-B2AA-BBB0CB371B12Q57856044-92BA787C-A128-42A5-9A4B-08440DE4A757Q57856284-498A92D7-2906-4E30-A134-8DD5C4F98C96Q58024584-57CC054F-A712-4542-98B5-FA3BD10E6DE7Q58201012-B3D98DBB-C305-4F9F-BAF5-AF13CAF38187Q58201015-4BB0D399-FEF2-4F8E-B940-351866B167DCQ58201056-D28A17A0-4353-40DF-A83D-F11AEE6E9B3DQ58205452-B6940EFC-71E7-43D2-9685-1659B391F86AQ58208753-89BE083E-475C-4D9B-98D9-E582B51D93B2Q58525170-E90DCEE4-C897-4785-ADBC-D90C89F5B6B5Q58692024-1DC3D6AF-73AE-44A7-900B-2D13329FACC6Q58863600-21619EDF-566A-4769-ABA7-5E8631BB524EQ58911337-0382DBA1-66BC-41D5-B3A0-E17D10D1330DQ58911746-60B51D49-73F6-4523-9D5B-288E1E2D9058Q58912692-446ED821-69C3-4CA9-BF7D-8C8F099B8B67Q59005629-9B24A02A-B118-4E64-843C-844357130239Q59066641-47B847D9-5C7B-4DC3-9380-7E86A838BBDAQ59068131-DB2BAFC2-9929-4340-A6D9-4E93B33CBD44Q59071921-AE36DEEB-EA8F-46B8-8194-1296C9588EC2Q59105980-0B8C54CC-FDEB-4481-87D0-4AA57358C37CQ59118471-B678AD86-7038-4959-8EB1-1704016782C8
P2860
description
im November 1997 veröffentlichter wissenschaftlicher Artikel
@de
wetenschappelijk artikel
@nl
наукова стаття, опублікована в листопаді 1997
@uk
name
Variable neighborhood search
@en
Variable neighborhood search
@nl
type
label
Variable neighborhood search
@en
Variable neighborhood search
@nl
prefLabel
Variable neighborhood search
@en
Variable neighborhood search
@nl
P1476
Variable neighborhood search
@en
P2093
N. Mladenović
P304
P356
10.1016/S0305-0548(97)00031-2
P577
1997-11-01T00:00:00Z