Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:(%220945-1382%22)

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2218

  • Page / 89
Export

Selection :

  • and

The Benefits and Harms of Existence and Non-ExistenceJOHANSSON, Jens.The Journal of ethics. 2013, Vol 17, Num 1-2, issn 1382-4554, 152 p.Serial Issue

A bicriteria approach to scheduling a single machine with job rejection and positional penaltiesSHABTAY, Dvir; GASPAR, Nufar; YEDIDSION, Liron et al.Journal of combinatorial optimization. 2012, Vol 23, Num 4, pp 395-424, issn 1382-6905, 30 p.Article

An FPTAS for uniform machine scheduling to minimize makespan with linear deteriorationMING LIU; FEIFENG ZHENG; CHENGBIN CHU et al.Journal of combinatorial optimization. 2012, Vol 23, Num 4, pp 483-492, issn 1382-6905, 10 p.Article

An optimal online algorithm for single machine scheduling to minimize total general completion timeMING LIU; CHENGBIN CHU; YINFENG XU et al.Journal of combinatorial optimization. 2012, Vol 23, Num 2, pp 189-195, issn 1382-6905, 7 p.Article

Fault-tolerant diameter for three family interconnection networksTONGLIANG SHI; MEI LU.Journal of combinatorial optimization. 2012, Vol 23, Num 4, pp 471-482, issn 1382-6905, 12 p.Article

Minimum common string partition revisitedHAITAO JIANG; BINHAI ZHU; DARNING ZHU et al.Journal of combinatorial optimization. 2012, Vol 23, Num 4, pp 51-527, issn 1382-6905, 477 p.Article

On backbone coloring of graphsWEIFAN WANG; YUEHUA BU; MONTASSIER, Mickaël et al.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 79-93, issn 1382-6905, 15 p.Article

On the construction of k-connected m-dominating sets in wireless networksYINGSHU LI; YIWEI WU; CHUNYU AI et al.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 118-139, issn 1382-6905, 22 p.Article

Packing cycles exactly in polynomial timeQIN CHEN; XUJIN CHEN.Journal of combinatorial optimization. 2012, Vol 23, Num 2, pp 167-188, issn 1382-6905, 22 p.Article

Competent genetic algorithms for weighing matricesKOTSIREAS, I. S; KOUKOUVINOS, C; PARDALOS, P. M et al.Journal of combinatorial optimization. 2012, Vol 24, Num 4, pp 508-525, issn 1382-6905, 18 p.Article

Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problemCREPUT, Jean-Charles; HAJJAM, Amir; KOUKAM, Abderrafiaa et al.Journal of combinatorial optimization. 2012, Vol 24, Num 4, pp 437-458, issn 1382-6905, 22 p.Article

Vertices in all minimum paired-dominating sets of block graphsLEI CHEN; CHANGHONG LU; ZHENBING ZENG et al.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 176-191, issn 1382-6905, 16 p.Article

Can Contractualism Save Us from Aggregation? = Le contractualisme peut-il nous sauver de l'aggrégation ?FRIED, Barbara H.The Journal of ethics. 2012, Vol 16, Num 1, pp 39-66, issn 1382-4554, 28 p.Article

Approximating k-generalized connectivity via collapsing HSTsSEGEV, Danny.Journal of combinatorial optimization. 2011, Vol 21, Num 3, pp 364-382, issn 1382-6905, 19 p.Article

Approximating the chromatic index of multigraphsGUANTAO CHEN; XINGXING YU; WENAN ZANG et al.Journal of combinatorial optimization. 2011, Vol 21, Num 2, pp 219-246, issn 1382-6905, 28 p.Article

Hardness and algorithms for rainbow connectionCHAKRABORTY, Sourav; FISCHER, Eldar; MATSLIAH, Arie et al.Journal of combinatorial optimization. 2011, Vol 21, Num 3, pp 330-347, issn 1382-6905, 18 p.Article

Minimizing makespan in an ordered flow shop with machine-dependent processing timesCHOI, Byung-Cheon; LEUNG, Joseph Y-T; PINEDO, Michael L et al.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 797-818, issn 1382-6905, 22 p.Article

On the power domination number of the generalized Petersen graphsGUANGJUN XU; LIYING KANG.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 282-291, issn 1382-6905, 10 p.Article

Optimal semi-online algorithm for scheduling with rejection on two uniform machinesXIAO MIN; JING LIU; YUQING WANG et al.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 674-683, issn 1382-6905, 10 p.Article

Optimal wafer cutting in shuttle layout problemsNISTED, Lasse; PISINGER, David; ALTMAN, Avri et al.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 202-216, issn 1382-6905, 15 p.Article

Polynomially solvable special cases of the quadratic bottleneck assignment problemBURKARD, Rainer E; RISSNER, Roswitha.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 845-856, issn 1382-6905, 12 p.Article

Restrained domination in cubic graphsHATTINGH, Johannes H; JOUBERT, Ernst J.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 166-179, issn 1382-6905, 14 p.Article

Semi-online scheduling on two uniform machines with the known largest sizeCAI, Sheng-Yi; YANG, Qi-Fan.Journal of combinatorial optimization. 2011, Vol 21, Num 4, pp 393-408, issn 1382-6905, 16 p.Article

The flexible blocking job shop with transfer and set-up timesGRÖFLIN, Heinz; NGUYEN PHAM, Dinh; BIIRGY, Reinhard et al.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 121-144, issn 1382-6905, 24 p.Article

Co-2-plex polynomialsMCCLOSKY, Benjamin; SIMMS, Anthony; HICKS, Illya V et al.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 640-650, issn 1382-6905, 11 p.Article

  • Page / 89