Keywords: Single-machine scheduling; Non-availability period; Dynamic programming; Fully polynomial-time approximation scheme; 90B35; 90C27;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 90C26; 90C10; 90C27; 90C06; Integer linear programming; Subgradient method; Nonsmooth optimization; Travelling salesman problem;
Keywords: Affine matrix rank minimization; Transformed affine matrix rank minimization; Non-convex fraction function; Equivalence; DC algorithm; 90C26; 90C27; 90C59;
Keywords: 90C27; 90C60; 68Q25; Robust optimization; k-adaptability; Discrete uncertainty;
Keywords: Cellular evolutionary algorithm; Examination timetabling; ITC 2007 benchmark set; Memetic algorithms; Threshold acceptance algorithm; Timetabling; Uncapacitated Toronto benchmark set; 90-08; 90B40; 90C27; 90C35; 90C59;
Keywords: 90C27; 90C57; 90C35; 90C90; Clique problem with multiple-choice constraints; Staircase compatibility; Total unimodularity; Scheduling; Piecewise linearization;
Keywords: Stochastic Knapsack problem; Dynamic programming; Shortest path problem with resource constraints; 90C15; 90C27; 90C35;
Keywords: 90B35; 90C27; Scheduling; Two-agent; Linear deterioration; Pareto optimization;
Keywords: 90C27; 05C70; 05C85; 68R10; Combinatorial algorithm; Matching theory; Traveling salesman problem; Restricted 2-matching; Subtour elimination constraint; Hamilton-laceable graph;
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
Keywords: 90C27; 90C57; Graph bisection; Graph partitioning; Polyhedral combinatorics;
Keywords: 91A12; 91A43; 90C27; Cooperative game; Convex game; Restricted game; Partitions; Supermodularity; Intersecting subsets;
Keywords: 90B50; 90C27; Metaheuristic; Adaptive large neighborhood search; Patient admission scheduling;
Keywords: 90C11; 91B25; 90C27; 90C35; 68C05; 05C85Mixed integer programming; Network flow problems; Total unimodularity; Optimal product pricing; Algorithms
Keywords: 05C69; 90C10; 90C27; 90C57; 90C35; 90C39; Dominating set; Cardinality constraint; Tree; Polynomial-time algorithm; Integral polytope;
Keywords: The particle swarm optimization; Fractional calculus; Fractional model; Simulation; Stability; Control; 90C27; 90C35; 90C59; 90C30; 28B20; 26A33; 33C20; 30C45; 26A33;
Keywords: Pollution-routing problem; Speed optimization; Green transportation; Mixed-integer convex programming; 90B06; 90C11; 90C26; 90C27;
Keywords: 90C10; 90C27; 90C57; Set covering; Set packing; Set partitioning; Polyhedral structure; Facet-defining inequalities; Odd hole;
Keywords: 90C27; 90C10; 90C90; 05C90; 90B80; Discrete location and assignment; Integer linear programming; Vertex-disjoint path cover; Shortest common supersequence;
Keywords: 05C85; 90C27; Edge dominating set; Multicut; Primal-dual algorithm;
Keywords: 68M07; 68M20; 68N20; 68W01; 90C10; 90C27; Instruction scheduling; Integer programming; Branch-and-cut;
Keywords: 15A23; 15B48; 52B05; 52B11; 65D99; 65F30; 90C27; Usual rank; Nonnegative matrix; K-means clustering; Convex hull;
Keywords: 62H30; 68T10; 90C26; 90C27; 91C20; 47N10Clustering; Data mining; Cluster separability; Separability balls
Keywords: 05C65; 94B05; 90C27; 55U10Linear code; Triangular configuration; Geometric representation; Simplicial complex; Weight enumerator
Keywords: 90C25; 90C27; 65K10Sparse recovery on Euclidean Jordan algebra; Nuclear norm minimization; Restricted isometry property; Null space property; s-goodness; Exact and stable recovery
Keywords: 90C10; 90C27; 90C57; 90C90; 52B12Integer linear programming; Computational geometry; Symbol maps; Cartography; Visualization
Keywords: 05C15; 05C50; 05C85; 90C27; 65D25; 65F50; Grid coloring algorithm; Divide-and-conquer approach; Lipton-Tarjan separator; Stencil discretization; Derivative computation; Sparsity exploitation;
Keywords: 90C27; 05C70; 05C83Connected matching; Hadwiger number; Bipartite margin shop problem; Chordal bipartite graphs
Keywords: 90C27; 90C57; 90C11; 97R50Combinatorial optimization; Branch-and-bound; Data mining; Mixed integer programming
Keywords: 65K05; 90C26; 90C27; 90C59Heuristic algorithms; Biased randomization; Iterated Local Search; Scheduling; Flow-shop; Non-smooth objective functions
Keywords: 90B06; 90C10; 90C27; 90C57Traveling Salesman problem; Multiple stacks; Polyhedral study; Branch-and-cut
On the NP-hardness of scheduling with time restrictions
Keywords: 90B35; 90C27; Single-processor scheduling; Time restrictions; NP-hardness;
Affine matrix rank minimization problem via non-convex fraction function penalty
Keywords: 90C26; 90C27; 90C59; Affine matrix rank minimization; Low-rank; Matrix completion; Fraction function; Iterative singular value thresholding algorithm; Image inpainting;
A novel representation of rank constraints for real matrices
Keywords: 15A03; 15A23; 65F30; 90C27; 93A30Rank-minimization; Low-rank approximation; Sparse representation
The hypergraph assignment problem
Keywords: 90C27; Hypergraph; Bipartite hypergraph; Assignment; Extended formulation;
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Keywords: 90C27; 52B40; 52A41; 05C22BS-convex functions; Bisubmodular polyhedra; The Freudenthal simplicial divisions; Discrete convexity
Generalized skew bisubmodularity: A characterization and a min-max theorem
Keywords: 90C27; Skew bisubmodularity; Submodularity; Convex extensions;
A bad example for the iterative rounding method for mincost kk-connected spanning subgraphs
Keywords: 90C27; 68W25; 05C40Approximation algorithms; LP relaxations; Iterative rounding method; Graph connectivity; kk-connected spanning subgraphs; Extreme point solutions
Approximating the least core value and least core of cooperative games with supermodular costs
Keywords: 91A12; 90C27; 90B35; 68W25; Cooperative games; Least core; Approximation algorithms; Scheduling; Matroids;
A computational comparison of flow formulations for the capacitated location-routing problem
Keywords: 90C27; 90C57Location-routing; Flow formulations; Branch-and-cut
Fractional perfect b-matching polytopes I: General theory
Keywords: 52B05; 05C50; 05C70; 52B11; 90C27; 90C35Graphs; Polytopes; Perfect matchings
The dominance assignment problem
Keywords: 90C27; 05A05; 65F30; 05C85; 90B80Assignment problem; Bottleneck assignment; Lexicographic bottleneck assignment; Clutter; Combinatorial matrices; Permutations
Ad hoc heuristic for the cover printing problem
Keywords: 90C10; 90C27; 90C59; 90C90Combinatorial optimization; Integer nonlinear programming; Cover printing; Label printing; Heuristic; Job splitting
On duality and fractionality of multicommodity flows in directed networks
Keywords: 90C27; 05C21Multicommodity flows; Metrics; Min–max theorems; Facility locations
Machine covering with combined partial information
Keywords: Scheduling; Design and analysis of algorithm; Semi-online; Competitive ratio90B35; 90C27; 68M20
Embedded associated primes of powers of square-free monomial ideals
Keywords: 13A17; 13F55; 05C65; 90C27
On shortest disjoint paths in planar graphs
Keywords: 05C85; 68R10; 90C27; 90C35Disjoint paths; Shortest path; Planar graph; Objective function; Minimum cost flow
On the polyhedral lift-and-project methods and the fractional stable set polytope
Keywords: 90C10; 90C27; 47D20Stable set problem; Lift-and-project; Integer programming
A hybrid SAGA algorithm for the construction of E(s2)-optimal cyclic supersaturated designs
Keywords: 62K10; 62K15; 90C27; 90C59; Cyclic generator; E(s2)-optimality; Factorial designs; Genetic algorithms; Hybrid; Metaheuristics; Simulated annealing; Supersaturated designs;
Minimum partition of an independence system into independent sets
Keywords: 90C27; 05C15; 05C69Independence system; Hereditary property; Conditional colouring; Conditional chromatic number; Minimum set cover problem; Domination number; Connected domination number; Clique domination number; Split graph
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Keywords: 90C27; 90C49; 90C35; 65K05; 91A90Combinatorial optimization; Minimum Cost Network Flow Problem; Simplex algorithm; Exterior point algorithm