Keywords: شعبه و برش; Train timetabling; Dynamic demand; Regular timetable; Exact algorithm; Branch-and-cut
مقالات ISI شعبه و برش (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: شعبه و برش; Zero–one quadratic programming; Max-cut problem; Polyhedral combinatorics; Branch-and-cut
Keywords: شعبه و برش; Generalized vehicle routing; Two-commodity flow model; Branch-and-cut; Metaheuristic
Keywords: شعبه و برش; Orienteering Problem; Branch-and-cut; Tabu search
Keywords: شعبه و برش; Equitable coloring; Branch-and-cut; Tabu search heuristic
Keywords: شعبه و برش; Split Delivery Vehicle Routing Problem; Branch-and-cut
Keywords: شعبه و برش; Combinatorial optimization; Min-degree constrained minimum spanning tree problem; Branch-and-cut; Integer programming formulations
Keywords: شعبه و برش; Traveling Salesman Problem; Branch-and-bound; Branch-and-cut; Heuristical methods; Exact methods; Bioinformatics;
Keywords: شعبه و برش; Hub location; Routing; Valid inequalities; Branch-and-cut;
Keywords: شعبه و برش; Traveling purchaser problem; Pickup and delivery; Last-in-first-out; Branch-and-cut;
Keywords: شعبه و برش; Intermodal transportation; Production planning; Environmental goals; Branch-and-Cut; Multi-objective optimization; Pareto-optimal solutions;
Keywords: شعبه و برش; Multi-commodity location-routing; Flow intercepting facility location; Branch-and-cut; City logistics;
Keywords: شعبه و برش; energy aware networking; shared protection; branch-and-cut
Keywords: شعبه و برش; Hamiltonian; p-median; Branch-and-cut; Metaheuristic
Keywords: شعبه و برش; Integer programming; Benders decomposition; Branch-and-cut; Green wireless local area network; Network design
Keywords: شعبه و برش; Covering salesman; Valid inequalities; Branch-and-cut
Keywords: شعبه و برش; Pickup and delivery problem; Loading cost; Branch-and-price; Branch-and-cut; Healthcare transportation
Keywords: شعبه و برش; 90B06; 90C10; 90C27; 90C57Traveling Salesman problem; Multiple stacks; Polyhedral study; Branch-and-cut
Keywords: شعبه و برش; Star coloring; Sparse Hessian; Complete linear description; Total dual integrality; Branch-and-cut
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
Keywords: شعبه و برش; Asymmetric VPN tree; polyhedral approach; facet; Branch-and-Cut;
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems
Keywords: شعبه و برش; Bilevel programming; Risk Assessment Graphs; Countermeasure selection; Branch-and-cut;
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
Keywords: شعبه و برش; Combinatorial optimization; Min-max regret generalized assignment problem; Branch-and-cut; Lagrangian relaxation; Variable fixing;
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
Keywords: شعبه و برش; Networks; Benders decomposition; Branch-and-cut; Pareto-optimality;
A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification
Keywords: شعبه و برش; Bilevel problem; Hub fortification; Hub interdiction; Branch-and-cut;
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems
Keywords: شعبه و برش; Combinatorial optimization; Orienteering Problem; Generalized traveling salesman problem; Integer programming; Branch-and-cut;
Branch-and-cut approaches for p-Cluster Editing
Keywords: شعبه و برش; Cluster Editing; Valid inequalities; Branch-and-cut;
Projection results for the k-partition problem
Keywords: شعبه و برش; Graph partitioning; Polyhedral combinatorics; Branch-and-cut; Semidefinite programming;
The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
Keywords: شعبه و برش; k-node-connected graph; Polytope; Facets; Separation; Branch-and-Cut;
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut
Keywords: شعبه و برش; k-node connected graph; polytope; separation; branch-and-cut;
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
Keywords: شعبه و برش; Orienteering Arc Routing Problem; Routing problems with profits; Branch-and-cut
An extended edge-representative formulation for the K-partitioning problem
Keywords: شعبه و برش; graph partitioning; combinatorial optimization; polyhedral approach; branch-and-cut
Solving resource constrained shortest path problems with LP-based methods
Keywords: شعبه و برش; Resource constrained shortest path; Integer programming; Branch-and-cut; Primal heuristics; Combinatorial optimization
Generalized multiple depot traveling salesmen problem—Polyhedral study and exact algorithm
Keywords: شعبه و برش; Generalized multiple depot traveling salesmen; Routing; Branch-and-cut; Polyhedral study
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
Keywords: شعبه و برش; Integer programming; Branch-and-cut; Generalized network design; Hop-constraints; Layered graph
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
Keywords: شعبه و برش; Bi-objective connected facility location; k-architecture connected facility location; Branch-and-cut; Local branching; Neighborhood search; ILP heuristics;
The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut
Keywords: شعبه و برش; Weakly connected independent set; Polytopes; Valid inequalities; Graph operations; Branch-and-Cut;
Benders decomposition without separability: A computational study for capacitated facility location problems
Keywords: شعبه و برش; Benders decomposition; Congested capacitated facility location; Perspective reformulation; Branch-and-cut; Mixed-integer convex programming;
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Keywords: شعبه و برش; Combinatorial optimization; Branch-and-cut; K-rooted mini–max spanning forest problem; Optimality cuts
On exact solutions for the Minmax Regret Spanning Tree problem
Keywords: شعبه و برش; Minimum Spanning Tree; Minmax regret; Robust optimization; Interval uncertainty; Branch-and-cut; Benders decomposition
A note on the separation of subtour elimination constraints in elementary shortest path problems
Keywords: شعبه و برش; Integer programming; Branch-and-cut; Separation; Subtour elimination constraints; Strong components
The exact solution of several classes of inventory-routing problems
Keywords: شعبه و برش; Inventory-routing; Vehicle routing; Inventory management; Multi-vehicle; Transshipment; Consistency; Branch-and-cut
Hose workload based exact algorithm for the optimal design of virtual private networks
Keywords: شعبه و برش; Virtual private network; Hose model; Branch-and-Cut; Maximum flow problem; Cutting plane; Separation problem
A maritime inventory routing problem: Practical approach
Keywords: شعبه و برش; IRP; Branch-and-Cut; Large neighborhood search; Maritime inventory routing
An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
Keywords: شعبه و برش; Covering tour; Two-commodity flow model; Branch-and-cut; Metaheuristic
Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform
Keywords: شعبه و برش; Multicluster; Non-dedicated; Scientific workflow; Scheduling; Branch-and-cut
Exact approaches for solving robust prize-collecting Steiner tree problems
Keywords: شعبه و برش; Prize collecting Steiner trees; Robust optimization; Interval uncertainty; Mixed integer programming; Branch-and-cut
A stochastic inventory routing problem with stock-out
Keywords: شعبه و برش; Inventory routing; Stochastic demand; Hybrid algorithms; Rollout algorithms; Branch-and-cut
A computational comparison of flow formulations for the capacitated location-routing problem
Keywords: شعبه و برش; 90C27; 90C57Location-routing; Flow formulations; Branch-and-cut
The undirected m-Capacitated Peripatetic Salesman Problem
Keywords: شعبه و برش; Peripatetic Salesman Problem; Traveling Salesman Problem; Capacity; Branch-and-cut; Branch-and-price;
A computational study on the quadratic knapsack problem with multiple constraints
Keywords: شعبه و برش; 0-1 quadratic programming; Knapsack problem; Mixed integer quadratic program; Branch-and-cut; Linearization