Keywords: شعبه و برش; Auction mechanisms; Branch and cut; Locational marginal price (LMP); Mixed Integer Genetic Algorithm; Payment cost minimization (PCM);
مقالات ISI شعبه و برش (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: شعبه و برش; Location-routing; Branch and cut; Lagrangian relaxation; Medicine delivery;
Keywords: شعبه و برش; Cutting; Branch and cut; Polyhedral combinatorics; Two-echelon vehicle routing;
Keywords: شعبه و برش; Combinatorial optimization; Lagrangian relaxation; Branch and cut; Multi-period spanning trees;
Keywords: شعبه و برش; Optical network design; Regenerator placement; Integer programming; Branch and cut; Facets;
Keywords: شعبه و برش; Location allocation; Liner shipping; Network design; Fleet deployment; Empty repositioning; Valid inequalities; Branch and cut; Benders decomposition;
Keywords: شعبه و برش; Earth observation satellites; Uncertainties of clouds; Proactive scheduling; Chance constraint programming; Sample approximation; Branch and cut;
Keywords: شعبه و برش; Integer linear programming; Local search; Branch and cut
Keywords: شعبه و برش; Vehicle routing problem; Branch and cut; Split demand
Keywords: شعبه و برش; Redundancy allocation problem; Multiple choice knapsack problem; Branch and cut;
Keywords: شعبه و برش; Regenerator location; Hub location; Survivable network design; Branch and cut
Keywords: شعبه و برش; Combinatorial optimization; Integer programming; Time-Dependent TSP; Branch and Cut
Keywords: شعبه و برش; Relay node placement; Cutting plane/facet; Polyhedral theory; Projection; Branch and cut; Lagrangian-relaxation
Keywords: شعبه و برش; Berth allocation; Quay crane scheduling; Mixed integer formulations; Branch and cut; Rolling horizon heuristic;
Algorithms for the Minmax Regret Path problem with interval data
Keywords: شعبه و برش; Minmax Regret Model withinterval data; Simulated annealing; Shortest path problem; Branch and cut; Neighbourhoods for path problems;
Benders decomposition with integer subproblem
Keywords: شعبه و برش; Benders decomposition; Integer subproblem; Branch and cut; Local cuts; Global cuts; CFCMKP; capacitated fixed charge multiple knapsack problem; B&C-LC; Branch-and-Cut algorithm with local cuts; B&C-NotLC; Branch-and-Cut algorithm without Local cuts; A-RPS
The multiple vehicle pickup and delivery problem with LIFO constraints
Keywords: شعبه و برش; Vehicle routing; Pickup and delivery; LIFO constraints; Mixed-integer programming; Branch and cut
A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem
Keywords: شعبه و برش; Branch and bound; Branch and cut; Integer programming; Minimum-energy topology
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows
Keywords: شعبه و برش; Vehicle Routing Problem with Time Windows; Mixed Integer Programming; Branch and Cut;
A branch and cut algorithm for the hierarchical network design problem
Keywords: شعبه و برش; Extensive facility location; Hierarchical networks; Branch and cut; Cutting planes
Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming
Keywords: شعبه و برش; Stochastic programming; Project scheduling; Integer programming; Branch and cut; Pharmaceutical research and development
Exact and heuristic solutions of the global supply chain problem with transfer pricing
Keywords: شعبه و برش; Metaheuristics; Alternate heuristic; Supply chain management; Transfer pricing; Bilinear programming; Branch and cut
Solving the hub location problem with modular link capacities
Keywords: شعبه و برش; Hub location; Branch and cut; Tabu search; Heuristic concentration