The following pages link to Discrete Optimization (Q408368):
Displaying 50 items.
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Orbitopal fixing (Q408377) (← links)
- On zeroth-order general Randić index of quasi-tree graphs containing cycles (Q429644) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Upgrading edge-disjoint paths in a ring (Q429680) (← links)
- Generalized resolution search (Q429682) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- An exact algorithm for the network pricing problem (Q429686) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- A note on ``Lot-sizing with fixed charges on stocks: the convex hull'' (Q429698) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Ad hoc heuristic for the cover printing problem (Q435726) (← links)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Emergency path restoration problems (Q435733) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
